Duality between the Erlang loss system and a finite source queue
From MaRDI portal
Publication:688934
DOI10.1016/0167-6377(93)90007-4zbMath0777.60088OpenAlexW2053118406MaRDI QIDQ688934
Publication date: 1 November 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(93)90007-4
queuetime-sharing computer systemsduality relationmodel of multiple access systemsmodel of telephone exchangesmultiple access communication channels
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Finite source Erlang based queueing systems: Complementarity, equivalence and their implications ⋮ On the cycle maximum of birth-death processes and networks of queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The G/M/r machine interference model
- Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room
- The M/G/k loss system with servers subject to breakdown
- Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
- The M/G/k Blocking System with Heterogeneous Servers
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
- On Erlang's Formula
- A Combinatorial Method in the Theory of Queues
This page was built for publication: Duality between the Erlang loss system and a finite source queue