Customer average and time average queue lengths and waiting times
- 1 September 1971
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 8 (3), 535-542
- https://doi.org/10.2307/3212176
Abstract
Bounds are obtained for the difference between the expected number in the queue found by an arrival and the time average expected number in the queue for the stationary GI/G/m queue. The lower bound is completely general but the upper bound requires that the class of inter-arrival distributions be restricted. When the upper bound applies, these quantities differ by at most one customer. Analogous results are obtained for the difference between the arrival average and time average number in the system for the GI/G/1 queue. An upper bound is also determined for the kth factorial moment of the number found in the queue by an arrival in terms of the kth. moment about the origin of the wait in the queue. Inequalities on the mean virtual wait are found in terms of the mean actual wait which show that under the same restrictions, these two measures of congestion differ by no more than half the mean inter-arrival time for the GI/G/1 queue.Keywords
This publication has 8 references indexed in Scilit:
- Work-conserving prioritiesJournal of Applied Probability, 1970
- Inequalities in the Theory of QueuesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1970
- Some Inequalities in QueuingOperations Research, 1968
- Two-Sided Inequalities for Waiting Time and Queue Size Distributions in $GI/G/1$Theory of Probability and Its Applications, 1968
- Some inequalities for the queue GI/G/1Biometrika, 1962
- A Proof for the Queuing Formula: L = λWOperations Research, 1961
- On the distribution of queue size in queueing problemsActa Mathematica Hungarica, 1959
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956