On the three-queue priority polling system with threshold service policy

详细信息    查看全文

• 作者：Zaiming Liu ; Yuqing Chu ; Jinbiao Wu
• 关键词：Polling system ; Priority ; Kernel method ; Heavy ; traffic ; Interpolation
• 刊名：Journal of Applied Mathematics and Computing
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：53
• 期：1-2
• 页码：445-470
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Computational Mathematics and Numerical Analysis; Appl.Mathematics/Computational Methods of Engineering; Theory of Computation; Mathematics of Computing;
• 出版者：Springer Berlin Heidelberg
• ISSN：1865-2085
• 卷排序：53

文摘

In this paper, a priority polling system consisting of three M / M / 1 queues, served by a single server is investigated. Queue 1 has the Head-of-Line (HoL) priority and Queue 2 has a higher priority over Queue 3 with threshold N. All the switches are instantaneous and preempting. Using the Kernel method we derive the probability of generating functions of the stationary joint queue-length distributions, which yields the mean queue lengths and the mean sojourn times. Furthermore, we consider the limit behaviors in the light-traffic and heavy-traffic scenarios. And an interpolation approximation for the sojourn times utilizing the light and heavy traffic limits are illustrated. To test the validity, we also undertake some simulation works.