Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T14:49:31.868Z Has data issue: false hasContentIssue false
  • English
  • Français

Distribution of the number of customers served in an M/G/1 retrial queue

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

M. J. Lopez-Herrero
M. J. Lopez-Herrero*
Affiliation:
Universidad Complutense de Madrid
*
∗ Postal address: Escuela de Estadistica, Universidad Complutense de Madrid, 28040 Madrid, Spain. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a recursive method of computation for the probability that at most k customers were served during the busy period of an M/G/1 retrial queue.

Keywords

Retrial queuebusy periodnumber of customers served

MSC classification

Primary: 60K25: Queueing theory
Type
Short Communications
Information
Journal of Applied Probability , Volume 39 , Issue 2 , June 2002 , pp. 407 - 412
Copyright
Copyright © Applied Probability Trust 2002 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Artalejo, J. R. (1999). Accessible bibliography on retrial queues. Math. Comput. Modelling 30, 1–6.Google Scholar
[2] Artalejo, J. R. (1999). A classified bibliography of research on retrial queues: Progress in 1990–1999. Top 7, 187–211.Google Scholar
[3] Artalejo, J. R., and Falin, G. I. (1996). On the orbit characteristics of the M/G/1 retrial queue. Naval Res. Logistics 43, 1147–1161.Google Scholar
[4] Artalejo, J. R., and Lopez-Herrero, M. J. (2000). On the busy period of the M/G/1 retrial queue. Naval Res. Logistics 47, 115–127.3.0.CO;2-C>CrossRefGoogle Scholar
[5] Artalejo, J. R., and Lopez-Herrero, M. J. (2001). Analysis of the busy period for the M/M/c queue: An algorithmic approach. J. Appl. Prob. 38, 209–222.Google Scholar
[6] Choo, Q. H., and Conolly, B. (1979). New results in the theory of repeated orders queueing systems. J. Appl. Prob. 16, 631–640.CrossRefGoogle Scholar
[7] Conolly, B., and Chan, J. (1977). Generalised birth and queueing processes: Recent results. J. Appl. Prob. 9, 125–140.Google Scholar
[8] Falin, G. I. (1979). A single-line system with secondary orders. Eng. Cybern. 17, 76–83.Google Scholar
[9] Falin, G. I., and Templeton, J. G. C. (1997). Retrial Queues. Chapman and Hall, London.Google Scholar
[10] Ghahramani, S. (1990). On remaining full busy periods of GI/G/c queues and their relation to stationary point processes. J. Appl. Prob. 27, 232–236.Google Scholar
[11] Kleinrock, L. (1975). Queueing Systems, Vol. 1, Theory. John Wiley, New York.Google Scholar
[12] Lopez-Herrero, M. J. (2002). On the number of customers served in the M/G/1 retrial queue: First moments and maximum entropy approach. To appear in Comput. Operat. Res. 29, 1739–1757.Google Scholar
[13] Natvig, B. (1975) On the waiting-time and busy period distributions for a general birth-and-death queueing model. J. Appl. Prob. 12, 524–532.Google Scholar