Counterexamples for comparisons of queues with finite waiting rooms
From MaRDI portal
Publication:1183688
DOI10.1007/BF01159210zbMath0747.60091WikidataQ124989033 ScholiaQ124989033MaRDI QIDQ1183688
Publication date: 28 June 1992
Published in: Queueing Systems (Search for Journal in Brave)
monotonicity; queueing system; stochastic comparisons; throughput; mean queue length; finite waiting rooms
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
On the Correlation Structure of Closed Queueing Networks, On the severity of Braess's paradox: designing networks for selfish users is hard
Cites Work
- 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 theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities
- Unnamed Item
- Unnamed Item