Abstract
We constructG/G/1/k queueing models that fail to have anticipated monotonicity properties with respect to the capacityk. In one model the long-run average number of customers in the system is arbitrarily close to the capacityk, but it decreases to an arbitrarily small value when the capacity is increased. In another model the throughput is arbitrarily close to the arrival rate when the capacity isk, but the throughput decreases to an arbitrarily small value when the capacity is increased. These examples involving non i.i.d. service times, which are associated with external arrivals instead of being assigned when service begins, show that stochastic assumptions and arguments involving more than direct sample-path comparisons are essential for obtaining useful bounds and positive comparison results.
References
P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Akademie-Verlag, Berlin, 1981).
D.P. Heyman and W. Whitt, Limits for queues as the waiting room grows, Queueing Systems 5 (1989) 381–392.
J. Keilson, The ergodic queue length distribution for queueing systems with finite capacity, J. Roy. Statist. Soc. Ser B 28 (1966) 190–201.
M. Miyazawa, Complementary generating functions for the MX/GI/1/k and GI/MY/1/k queues and their application to the comparison of loss probabilities, J. Appl. Prob. 27 (1990) 684–692.
D. Sonderman, Comparing multi-server queues with finite waiting rooms, I: same number of servers, Adv. Appl. Prob. 11 (1979) 439–447.
D. Sonderman, Comparing multi-server queues with finite waiting rooms, II: different numbers of servers, Adv. Appl. Prob. 11 (1979) 448–455.
H.C. Tijms,Stochastic Modelling and Analysis: A Computational Approach (Wiley, New York, 1986).
P. Tsoucas and J. Walrand, Monotonicity of throughput in non-Markovian networks, J. Appl. Prob. 26 (1989) 134–141.
W. Whitt, Comparing counting processes and queues, Adv. Appl. Prob. 13 (1981) 207–220.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Whitt, W. Counterexamples for comparisons of queues with finite waiting rooms. Queueing Syst 10, 271–278 (1992). https://doi.org/10.1007/BF01159210
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159210