Comparing multi-server queues with finite waiting rooms, I: Same number of servers

DOI10.2307/1426848zbMath0398.60092OpenAlexW2317872868MaRDI QIDQ4181770

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/1426848

zbMATH Keywords

BoundsQueuesFinite Waiting RoomsMultiserver QueuesPath OrderStochastic Comparisons

Mathematics Subject Classification ID

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

Related Items (14)

Monotonicity and error bounds for networks of Erlang loss queues ⋮ Rejection rules in the \(M/G/1\) queue ⋮ Further remarks on queueing network theory ⋮ Approximations of retrial queue with limited number of retrials ⋮ Comparing ordered-entry queues with heterogeneous servers ⋮ Almost sure comparison of birth and death processes with application to M/M/s queueing systems ⋮ On comparison of multiserver systems with multicomponent mixture distributions ⋮ 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 ⋮ A monotonicity result for a G/GI/c queue with balking or reneging ⋮ Limits for queues as the waiting room grows ⋮ Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers

This page was built for publication: Comparing multi-server queues with finite waiting rooms, I: Same number of servers