Transient behavior of coverage processes by applications to the infinite-server queue
Authors:
- Sid BrowneSBSid Browne
- J. Michael SteeleJSJ. Michael Steele
- 1 September 1993
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 30 (3) , 589-601
Abstract
We obtain the distribution of the length of a clump in a coverage process where thefirstline segment of a clump has a distribution that differs from the remaining segments of the clump. This result allows us to provide the distribution of the busy period in anM/G/∞queueing system withexceptionalfirst service, and applications are considered. The result also provides the tool necessary to analyze the transient behavior of anordinarycoverage process, namely thedepletiontime of the ordinaryM/G/∞system.Keywords
This publication has 13 references indexed in Scilit:
- Objects arranged randomly in space: an accessible theoryAdvances in Applied Probability, 1989
- Dynamic priority rules for cyclic-type queuesAdvances in Applied Probability, 1989
- Ordinary CLT and WLLN Versions of L = λWMathematics of Operations Research, 1988
- The backlog and depletion-time process for M/G/1 vacation models with exhaustive service disciplineJournal of Applied Probability, 1988
- Queueing systems with vacations ? A surveyQueueing Systems, 1986
- Bounds for the variance of the busy period of the M/G/∞ queueAdvances in Applied Probability, 1984
- Some results for secondary processes generated by a poisson processStochastic Processes and their Applications, 1974
- Some results for infinite server poisson queuesJournal of Applied Probability, 1969
- On infinite server queues with batch arrivalsJournal of Applied Probability, 1966
- On a probability problem arising in the theory of countersMathematical Proceedings of the Cambridge Philosophical Society, 1956