Duality between the \(M/G/s/s\) and \(GI/M/1/s/s\) queues
From MaRDI portal
Publication:1206094
DOI10.1016/0898-1221(92)90225-7zbMath0782.60063OpenAlexW1994399482MaRDI QIDQ1206094
Publication date: 1 April 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(92)90225-7
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 ⋮ Correspondences to abelian varieties. I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the finite-source \(\vec G/M/r\) queue
- The output of loss systems with general service time distributions
- The G/M/r machine interference model
- Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room
- On the M/G/k group-arrival loss system
- The M/G/k loss system with servers subject to breakdown
- Analysis and Optimization of a Loss Service System with Servers Subject to Random Breakdowns
- 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
- Poisson Arrivals See Time Averages
- The Generalized M/G/k Blocking System with Heterogeneous Servers
- The M/G/k group-arrival group-departure loss system
- Technical Note—The Busy Probability in M/G/N Loss Systems
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
- Some Properties of the Erlang Loss Function
- On Erlang's Formula
- Erlang's formula and some results on the departure process for a loss system
- A Combinatorial Method in the Theory of Queues
This page was built for publication: Duality between the \(M/G/s/s\) and \(GI/M/1/s/s\) queues