Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers

DOI10.2307/1426849zbMath0398.60093OpenAlexW2319980604MaRDI QIDQ4181771

David Sonderman

Publication date: 1979

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1426849

zbMATH Keywords

BoundsQueuesFinite Waiting RoomsMultiserver QueuesPath OrderStochastic Comparisons

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (8)

Monotonicity and error bounds for networks of Erlang loss queues ⋮ Further remarks on queueing network theory ⋮ Almost sure comparison of birth and death processes with application to M/M/s queueing systems ⋮ Monotonicity properties in various retrial queues and their applications ⋮ Counterexamples for comparisons of queues with finite waiting rooms ⋮ Error bounds for state space truncation of finite Jackson networks ⋮ Stability analysis of \(\mathrm{GI}/\mathrm{GI}/c/K\) retrial queue with constant retrial rate ⋮ Erlang loss bounds for OT-ICU systems

This page was built for publication: Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers