Abstract
We consider systems of GI/M/1 type with bulk arrivals, bulk service and exponential server vacations. The generating functions of the steady-state probabilities of the embedded Markov chain are found in terms of Riemann boundary value problems, a necessary and sufficient condition of ergodicity is proved. Explicit formulas are obtained for the case where the generating function of the arrival group size is rational. Resonance between the vacation rate and the system is studied. Complete formulas are given for the cases of single and geometric arrivals.
Similar content being viewed by others
References
B.T. Doshi, Queueing systems with vacations -A survey, Queueing Systems 1 (1986) 29–66.
A.M. Dukhovny, Markov chains with quasitoeplitz transition matrix, J. Appl. Math. Simul. 2(1) (1989) 71–82.
A.M. Dukhovny, Applications of vector Riemann boundary value problems to analysis of queueing systems, in: Advances in Queueing: Theory, Methods, and Open Problems, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1995).
A.M. Dukhovny, GIX/MY /1systems with resident server and generally distributed arrival and service groups, J. Appl. Math. Stoch. Analysis 9(2) (1996), 159–170.
F.D. Gakhov, Boundary Value Problems(Fizmatgiz, Moscow, 1977).
N. Tian, D. Zhang and C. Cao, The GI/M/1 queue with exponential vacations, Queueing Systems 5 (1989) 331–344.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dukhovny, A. Vacations in GI X/M Y/1 systems and Riemann boundary value problems. Queueing Systems 27, 351–366 (1997). https://doi.org/10.1023/A:1019178518379
Issue Date:
DOI: https://doi.org/10.1023/A:1019178518379