Technical Note—A Note on the M / G /1 Queue with Server Vacations

S. W. Fuhrmann
Additional contact information
S. W. Fuhrmann: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1984, vol. 32, issue 6, 1368-1373

Abstract: Consider an M / G /1 queuing system in which the server begins a vacation of random length each time that the system becomes empty. This model has been analyzed in several papers, which show that the number of customers present in the system at a random point in time is distributed as the sum of two independent random variables: (i) The number of Poisson arrivals during a time interval that is distributed as the forward recurrence time of a vacation, and (ii) the number of customers present in the corresponding standard M / G /1 queuing system (without vacations) at a random point in time. This note gives an intuitive explanation for this result, while simultaneously providing a more simple and elegant method of solution.

Keywords: 681; queues (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.6.1368 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:32:y:1984:i:6:p:1368-1373

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().