On the busy period of the M/G/1 retrial queue



Downloads per month over past year

Artalejo, Jesús R. and Lopez-Herrero, M. J. (2000) On the busy period of the M/G/1 retrial queue. Naval Research Logistics (NRL), 47 (2). pp. 115-127. ISSN 0894-069X

[thumbnail of arta52.pdf] PDF
Restringido a Repository staff only


Official URL: http://onlinelibrary.wiley.com/doi/10.1002/%28SICI%291520-6750%28200003%2947:2%3C115::AID-NAV3%3E3.0.CO;2-C/abstract


The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L.

Item Type:Article
Additional Information:

This research was supported by the European Commission under INTAS Grant no. 96-0828, the Complutense University under Grant no. PR64/99-8501 and the DGICYT under Grant no.
PB98-0837. The authors thank the referee for his/her helpful comments on an earlier version of this paper.

Subjects:Sciences > Mathematics > Operations research
ID Code:15866
Deposited On:09 Jul 2012 09:25
Last Modified:06 Aug 2018 09:53

Origin of downloads

Repository Staff Only: item control page