Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room
From MaRDI portal
Publication:1226811
DOI10.1007/BF01899724zbMath0328.60050MaRDI QIDQ1226811
Publication date: 1975
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/175667
Related Items (4)
Statistical inference for G/M/1 queueing system ⋮ On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots ⋮ Duality between the Erlang loss system and a finite source queue ⋮ Duality between the \(M/G/s/s\) and \(GI/M/1/s/s\) queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- A Transient Discrete Time Queue with Finite Storage
- CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
- On the Limiting Distribution of the Number of Coincidences Concerning Telephone Traffic
This page was built for publication: Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room
