Heavy-traffic asymptotics of a priority polling system with threshold service policy

In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system with three queues under threshold policy. It turns out that the scaled queue-length of the critically loaded queue is exponentially distributed, independent of that of the stable queues, which possess the same distributions as a two-class priority queue with N-policy vacation. Further, we provide an approximation of the tail queue-length distribution of the stable queues, which shows that it has the same prefactors and decay rates as the classical two-class preemptive priority queue. Stochastic simulations are taken to support the results. HighlightsThe heavy-traffic behavior of a polling system with threshold policy is discussed.The scaled queue-length of the critically loaded queue is exponentially distributed.Approximations of queue lengths of the stable queues are provided.The decay rates of the stable queues are the same decay rate as the classical preemptive priority queues.

[1]  J An.  Non-Preemptive Priority Queueing Models with Changeover Times and Switching Threshold , 2001 .

[2]  Yang Song,et al.  Exact tail asymptotics for a discrete-time preemptive priority queue , 2014, 1401.7722.

[3]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[4]  Zaiming Liu,et al.  On the three-queue priority polling system with threshold service policy , 2017 .

[5]  Jiqing Tan,et al.  Priority queueing model with changeover times and switching threshold , 2001, Journal of Applied Probability.

[6]  Hui Li,et al.  Exact tail asymptotics in a priority queue—characterizations of the preemptive model , 2009, Queueing Syst. Theory Appl..

[7]  Wei Feng,et al.  PERFORMANCE ANALYSIS OF A TWO-QUEUE MODEL WITH AN (M,N)-THRESHOLD SERVICE SCHEDULE , 2001 .

[8]  Isi Mitrani,et al.  Polling Models with Threshold Switching , 1995 .

[9]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[10]  Dimitris Bertsimas,et al.  Multiclass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws , 1997, Oper. Res..

[11]  Robert D. van der Mei,et al.  Polling systems with periodic server routing in heavy traffic: renewal arrivals , 2005, Oper. Res. Lett..

[12]  Hui Li,et al.  Exact tail asymptotics in a priority queue—characterizations of the non-preemptive model , 2011, Queueing Syst. Theory Appl..

[13]  Offer Kella,et al.  Priorities in M/G/1 queue with server vacations , 1988 .

[14]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[15]  Duan-Shin Lee,et al.  Queueing analysis of a threshold based priority scheme for ATM networks , 1993, TNET.

[16]  Yi Xie,et al.  Relative stability analysis of multiple queues , 2006, valuetools '06.

[17]  Ioannis Stavrakakis,et al.  Queueing study of a 3-priority policy with distinct service strategies , 1993, TNET.

[18]  Sem C. Borst,et al.  Interacting queues in heavy traffic , 2010, Queueing Syst. Theory Appl..

[19]  Ger Koole,et al.  A two-queue polling model with a threshold service policy , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[20]  Marko Boon,et al.  Heavy-traffic analysis of k-limited polling systems , 2013 .