On the Growth of the Maximum Queue Length in a Stable Queue

C. C. Heyde
Additional contact information
C. C. Heyde: Australian National University, Canberra, Australia

Operations Research, 1971, vol. 19, issue 2, 447-452

Abstract: Even for a stable one-server queue with relative traffic intensity less than unity, the maximum queue length observed will tend to infinity in probability as the length of time for which the system has been observed becomes large. It is important to have information on the behavior of the maximum queue length to enable estimation of the congestion likely to be encountered in a system operating over a long period. The present paper studies the stable GI / M /1 system, and, interpreting the results obtained rather loosely, one can say that the maximum queue length attained by the time the n th customer has arrived ( n large) can be expected to be of the order of log n .

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.2.447 (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:19:y:1971:i:2:p:447-452

Access Statistics for this article

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