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

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.

[1]  Johan van Leeuwaarden,et al.  On the application of Rouché's theorem in queueing theory , 2006, Oper. Res. Lett..

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

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

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

[5]  M. Zazanis.  Analyticity of Poisson-driven stochastic systems , 1992, Advances in Applied Probability.

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

[7]  Martin I. Reiman,et al.  An Interpolation Approximation for Queueing Systems with Poisson Input , 1988, Oper. Res..

[8]  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.

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

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

[11]  Onno Boxma,et al.  Dynamic server assignment in a two-queue model , 1995 .

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

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

[14]  Wei Feng,et al.  Analysis of a finite buffer model with two servers and two nonpreemptive priority classes , 2009, Eur. J. Oper. Res..

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

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

[17]  J.P.C. Blanc.  The power-series algorithm applied to cyclic polling systems , 1990 .

[18]  Ivo J. B. F. Adan,et al.  Closed-form waiting time approximations for polling systems , 2011, Perform. Evaluation.