Analysis of tandem polling queues with finite buffers

被引:0
作者
Ravi Suman
Ananth Krishnamurthy
机构
[1] University of Wisconsin-Madison,Department of Industrial and Systems Engineering
[2] Indian Institute of Management Bangalore,Decision Sciences
来源
Annals of Operations Research | 2020年 / 293卷
关键词
Polling queues; Finite buffers; Performance analysis;
D O I
暂无
中图分类号
学科分类号
摘要
We analyze a tandem polling queue with two stations operating under three different polling strategies, namely: (1) Independent polling, (2) Synchronous polling, and (3) Out-of-sync polling. Under Markovian assumptions of arrival and service times, we conduct an exact analysis using Matrix Geometric method to determine system throughput, mean queue lengths, and mean waiting times. Through numerical experiments, we compare the performance of the three polling strategies and the effect of buffer sizes on performance. We observe that the independent polling strategy generally performs better than the other strategies, however, under certain settings of product asymmetry, other strategies yield better performance.
引用
收藏
页码:343 / 369
页数:26
相关论文
共 67 条
[1]  
Altman E(1994)Polling in a closed network Probability in the Engineering and Informational Sciences 8 327-343
[2]  
Yechiali U(2003)Dynamic server allocation for queueing networks with flexible servers Operations Research 51 952-968
[3]  
Andradóttir S(1993)Marked point processes as limits of Markovian arrival streams Journal of Applied Probability 30 365-372
[4]  
Ayhan H(2018)Group maintenance policies for an R-out-of-N system with phase-type distribution Annals of Operations Research 261 79-105
[5]  
Down DG(2018)A threshold policy in a Markov-modulated production system with server vacation: The case of continuous and batch supplies Advances in Applied Probability 50 1246-1274
[6]  
Asmussen S(2017)Generalized control-limit preventive repair policies for deteriorating cold and warm standby Markovian systems IISE Transactions 49 1031-1049
[7]  
Koole G(1999)Decomposition esults for general polling systems and their applications Queueing Systems 31 295-316
[8]  
Barron Y(1999)Optimization of multiclass queueing networks with Changeover times via the achievable region approach: Part II, the multi-station case Mathematics of Operations Research 24 331-361
[9]  
Barron Y(2012)A polling model with reneging at polling instants Annals of Operations Research 198 5-23
[10]  
Barron Y(2009)Mixed gated/exhaustive service in a polling model with priorities Queueing Systems 63 383-399