The busy period of the Ek/G/1 queue by finite waiting room
- 1 June 1975
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 7 (2) , 416-430
- https://doi.org/10.2307/1426083
Abstract
For the Ek/G/1 queue with finite waiting room the phase technique is used to analyse the Markov chain imbedded in the queueing process at successive instants at which customers complete service, and the distribution of the busy period, together with the number of customers who arrive, and the number of customers served, during that period, is obtained. The limit as the size of the waiting room becomes infinite is found.Keywords
This publication has 2 references indexed in Scilit:
- Transient Behavior of Single-Server Queueing Processes With Erlang InputTransactions of the American Mathematical Society, 1961
- Transient behavior of single-server queueing processes with Erlang inputTransactions of the American Mathematical Society, 1961