Stability analysis of GI/GI/c/K retrial queue with constant retrial rate

We consider a finite buffer capacity GI/GI/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has $$c$$c identical servers and can accommodate up to $$K$$K jobs (including $$c$$c jobs under service). If a newly arriving job finds the primary queue to be full, it joins the orbit queue. The original primary jobs arrive to the system according to a renewal process. The jobs have i.i.d. service times. The head of line job in the orbit queue retries to enter the primary queue after an exponentially distributed time independent of the length of the orbit queue. Telephone exchange systems, medium access protocols, optical networks with near-zero buffering and TCP short-file transfers are some telecommunication applications of the proposed queueing system. The model is also applicable in logistics. We establish sufficient stability conditions for this system. In addition to the known cases, the proposed model covers a number of new particular cases with the closed-form stability conditions. The stability conditions that we obtained have clear probabilistic interpretation.

[1]  G Fayolle.  A simple telephone exchange with delayed feedbacks , 1986 .

[2]  E. Morozov,et al.  Stability analysis of regenerative queueing systems , 2009 .

[3]  R. Delgado,et al.  STABILITY ANALYSIS OF REGENERATIVE QUEUES , 2008 .

[4]  B. Krishna Kumar,et al.  On multiserver feedback retrial queues with balking and control retrial rate , 2006, Ann. Oper. Res..

[5]  Konstantin Avrachenkov,et al.  On tandem blocking queues with a common retrial queue , 2010, Comput. Oper. Res..

[6]  Antonio Gómez-Corral,et al.  Some decomposition formulae for M/M/r/r+d queues with constant retrial rate , 1998 .

[7]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[8]  R.S. Tucker,et al.  Towards a Bufferless Optical Internet , 2009, Journal of Lightwave Technology.

[9]  O. Brun,et al.  Analytical solution of finite capacity M/D/1 queues , 2000, Journal of Applied Probability.

[10]  Evsey Morozov,et al.  A multiserver retrial queue: regenerative stability analysis , 2007, Queueing Syst. Theory Appl..

[11]  Walter L. Smith,et al.  Regenerative stochastic processes , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[12]  D. Sonderman.  Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers , 1979, Advances in Applied Probability.

[13]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[14]  Jesus R. Artalejo,et al.  Analysis of multiserver queues with constant retrial rate , 2001, Eur. J. Oper. Res..

[15]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[16]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[17]  Evsey Morozov.  The tightness in the ergodic analysis of regenerative queueing processes , 1997, Queueing Syst. Theory Appl..

[18]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[19]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[20]  Rosa E. Lillo,et al.  A G/M/1-queue with exponential retrial , 1996 .

[21]  Uri Yechiali,et al.  RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC , 2008, Probability in the Engineering and Informational Sciences.

[22]  Bong Dae Choi,et al.  The M/G/1 Retrial Queue With Retrial Rate Control Policy , 1993, Probability in the Engineering and Informational Sciences.

[23]  Yang Woo Shin,et al.  Retrial queues with collision arising from unslottedCSMA/CD protocol , 1992, Queueing Syst. Theory Appl..

[24]  Luca Faust,et al.  Ergodicity And Stability Of Stochastic Processes , 2016 .

[25]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[26]  D. Sonderman.  Comparing multi-server queues with finite waiting rooms, I: Same number of servers , 1979, Advances in Applied Probability.

[27]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[28]  R. A. Silverman,et al.  Introductory Real Analysis , 1972 .

[29]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[30]  Karl Sigman,et al.  One-Dependent Regenerative Processes and Queues in Continuous Time , 1990, Math. Oper. Res..

[31]  Ronald W. Wolff,et al.  A Review of Regenerative Processes , 1993, SIAM Rev..

[32]  Evsey Morozov.  Weak Regeneration in Modeling of Queueing Processes , 2004, Queueing Syst. Theory Appl..

[33]  C. E. M. Pearce,et al.  AnM/M/1 retrial queue with control policy and general retrial times , 1993, Queueing Syst. Theory Appl..

[34]  Biswanath Mukherjee,et al.  Electrical ingress buffering and traffic aggregation for optical packet switching and their effect on TCP-level performance in optical mesh networks , 2002, IEEE Commun. Mag..

[35]  Dmitry Efrosinin,et al.  Queueing system with a constant retrial rate, non-reliable server and threshold-based recovery , 2011, Eur. J. Oper. Res..