Busy period in GIX/G/∞
- 1 September 1996
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 33 (3), 815-829
- https://doi.org/10.2307/3215361
Abstract
Busy period problems in infinite server queues are studied systematically, starting from the batch service time. General relations are given for the lengths of the busy cycle, busy period and idle period, and for the number of customers served in a busy period. These relations show that the idle period is the most difficult while the busy cycle is the simplest of the four random variables. Renewal arguments are used to derive explicit results for both general and special cases.Keywords
This publication has 10 references indexed in Scilit:
- Networks of non-homogeneous M/G/∞ systemsJournal of Applied Probability, 1994
- Transient behavior of coverage processes by applications to the infinite-server queueJournal of Applied Probability, 1993
- Autocorrelations in infinite server batch arrival queuesQueueing Systems, 1993
- Exact and approximate numerical solutions of steady-state distributions arising in the queueGI/G/1Queueing Systems, 1992
- Probability analysis of the repairable queueing systemM/G(E k /H)/1Annals of Operations Research, 1990
- On the GIX/G/∞ systemJournal of Applied Probability, 1990
- The busy period of the queueing system M/G/∞Journal of Applied Probability, 1985
- The busy period of order n in the GI/D/∞ queueJournal of Applied Probability, 1984
- Some results for infinite server poisson queuesJournal of Applied Probability, 1969
- On infinite server queues with batch arrivalsJournal of Applied Probability, 1966