Finite-capacity Vacation Models With Nonrenewal Input
(1991) Journal of Applied Probability — Vol. 28, n° 1, p. 174-197 (1991)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- This paper studies a single server queue with finite waiting room where the server takes vacations according to two different strategies: (i) an exhaustive service discipline, where the server takes a vacation whenever the system becomes empty and these vacations are repeated as long as there are no customers in the system upon return from a vacation, i.e. a repeated vacation strategy; (ii) a limited service discipline, where the server begins a vacation either if K customers have been served in the same busy period or if the system is empty and then a repeated vacation strategy is followed. The input process is a general Markovian arrival process introduced by Lucantoni, Meier-Hellstern and Neuts, which as special cases includes the Markov modulated Poisson process and the phase-type renewal process. The service times and vacation times each are generally distributed random variables. For both models, we obtain the queue length distribution at departures, at an arbitrary time instant and at arrival time. We also derive the loss probability of an arriving customer. We obtain formulae for the LST of the virtual waiting time distribution and for the LST of the waiting time distribution at arrival epochs.
- Affiliations
Citations
Blondia, C. (1991). Finite-capacity Vacation Models With Nonrenewal Input. Journal of Applied Probability, 28(1), 174-197. https://doi.org/10.2307/3214749 (Original work published 1991)