Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-27T11:05:45.919Z Has data issue: false hasContentIssue false
  • English
  • Français

Tail Asymptotics for the Queue Size Distribution in an M/G/1 Retrial Queue

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Jerim Kim ,
Bara Kim  and
Sung-Seok Ko
Jerim Kim*
Affiliation:
Korea University
Bara Kim*
Affiliation:
Korea University
Sung-Seok Ko*
Affiliation:
Konkuk University
*
∗Postal address: Department of Mathematics, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, Korea.
∗Postal address: Department of Mathematics, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, Korea.
∗∗∗Postal address: Department of Industrial Engineering, Konkuk University, 1 Hwayang-dong, Gwangjin-Gu, Seoul 143-701, Korea. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider an M/G/1 retrial queue, where the service time distribution has a finite exponential moment. We show that the tail of the queue size distribution is asymptotically given by a geometric function multiplied by a power function. The result is obtained by investigating analytic properties of probability generating functions for the queue size and the server state.

Keywords

M/G/1 retrial queuetail asymptoticsqueue size distribution

MSC classification

Secondary: 60K25: Queueing theory
Type
Short Communications
Information
Journal of Applied Probability , Volume 44 , Issue 4 , December 2007 , pp. 1111 - 1118
Copyright
Copyright © Applied Probability Trust 2007 

References

[1] Abate, J. and Whitt, W. (1997). Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems 26, 69–104.Google Scholar
[2] Abate, J., Choudhury, G. L. and Whitt, W. (1995). Exponential approximations for tail probabilities in queues. I. Waiting times. Operat. Res. 43, 885–901.Google Scholar
[3] Artalejo, J. R. (1999). A classified bibliography of research on retrial queues: progress in 1990–1999. TOP 7, 187–211.CrossRefGoogle Scholar
[4] Choi, B. D. and Chang, Y. (1999). Single server retrial queues with priority calls. Math. Comput. Modelling 30, 7–32.Google Scholar
[5] Choi, B. D. and Kim, B. (2000). Sharp result on convergence rate for the distribution of GI/M/1/K queues as K tends to infinity. J. Appl. Prob. 37, 1010–1019.Google Scholar
[6] Choi, B. D., Kim, B. and Wee, I.-S. (2000). Asymptotic behavior of loss probability in GI/M/1/K queue as K tends to infinity. Queueing Systems 36, 437–442.Google Scholar
[7] De Kok, A. G. (1984). Algorithmic methods for single server systems with repeated attempts. Statistica Neerlandica 38, 23–32.Google Scholar
[8] Falin, G. I. and Templeton, J. G. C. (1997). Retrial Queues. Chapman & Hall, London.CrossRefGoogle Scholar
[9] Kim, J. and Kim, B. (2007). Regularly varying tail of the waiting time distribution in M/G/1 retrial queue. Submitted.Google Scholar
[10] Li, Q.-L. and Zhao, Y. Q. (2005). Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type. Adv. Appl. Prob. 37, 1075–1093.CrossRefGoogle Scholar
[11] Miyazawa, M. and Zhao, Y. Q. (2004). The stationary tail asymptotics in the GI/G/1-type queue with countably many background states. Adv. Appl. Prob. 36, 1231–1251.Google Scholar
[12] Nobel, R. D. and Tijms, H. C. (2006). Waiting-time probabilities in the M/G/1 retrial queue. Statistica Neerlandica 60, 73–78.Google Scholar
[13] Sakurai, T. (2004). Approximating M/G/1 waiting time tail probabilities. Stoch. Models 20, 173–191.CrossRefGoogle Scholar
[14] Shang, W., Liu, L. and Li, Q. (2006). Tail asymptotics for the queue length in an M/G/1 retrial queue. Queueing Systems 52, 193–198.Google Scholar
[15] Takine, T. (2004). Geometric and subexponential asymptotics of Markov chains of M/G/1 type. Math. Operat. Res. 29, 624–648.Google Scholar
[16] Tijms, H. C. (1987). Stochastic Modelling and Analysis: A Computational Approach. John Wiley, Chichester.Google Scholar
[17] Willmot, G. (1988). A note on the equilibrium M/G/1 queue length. J. Appl. Prob. 25, 228–231.Google Scholar