Note---Comments on a Queueing Inequality

Daniel P. Heyman
Additional contact information
Daniel P. Heyman: Bell Laboratories, Holmdel, New Jersey

Management Science, 1980, vol. 26, issue 9, 956-959

Abstract: In a G/G/c/N system (a queue with general distributions of inter-arrival and service time, c servers and N - c \ge 0 queueing positions), let B be the steady-state probability that an arriving customer finds all queue positions filled and p be the time average probability that all queue positions are filled. By assuming p = B, Matthew Sobel proved where p is the traffic intensity. He also showed, by numerical examples, that the lower bound is a good approximation when p \ge 1.5 and c \ge 2. In this paper, we show that the lower bound does not require the assumption p = B to hold, and that it follows from the conservation of load. This derivation also explains why the bound does not depend on N and is a good approximation in heavy traffic. We also show that the upper bound depends critically on the assumption that p = B.

Keywords: queues; multiserver; inequalities (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.9.956 (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:ormnsc:v:26:y:1980:i:9:p:956-959

Access Statistics for this article

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