Counterexamples for comparisons of queues with finite waiting rooms

DOI10.1007/BF01159210zbMath0747.60091WikidataQ124989033 ScholiaQ124989033MaRDI QIDQ1183688

Ward Whitt

Publication date: 28 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

monotonicityqueueing systemstochastic comparisonsthroughputmean queue lengthfinite waiting rooms

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ On the Correlation Structure of Closed Queueing Networks

Cites Work

• Unnamed Item
• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Limits for queues as the waiting room grows
• Monotonicity of throughput in non-Markovian networks
• Comparing counting processes and queues
• Comparing multi-server queues with finite waiting rooms, I: Same number of servers
• Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities

This page was built for publication: Counterexamples for comparisons of queues with finite waiting rooms