Abstract
Consider a Markov-modulated G/G/1 queueing system in which the arrival and the service mechanisms are controlled by an underlying Markov chain. The classical approaches to the waiting time of this type of queueing system have severe computational difficulties. In this paper, we develop a numerical algorithm to calculate the moments of the waiting time based on Gong and Hu's idea. Our numerical results show that the algorithm is powerful. A matrix recursive equation for the moments of the waiting time is also given under certain conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen, Ladder heights and the Markov-modulated M/G/1 queue, Stoch. Process. Appl. 37 (1991) 313–326.
F. Baccalli and A.M. Makowski, Martingale relations for the M/G/1 queue with Markov-modulated Poisson input, Stoch. Process. Appl. 38 (1991) 99–133.
W.B. Gong and J.Q. Hu, The MacLaurin series for the GI/G/1 queue, J. Appl. Prob. 29 (1992) 176–184.
J.Q. Hu, Analyticity of single-server queues in light traffic, Manufacturing Engineering Department, Boston University, MA.
N.U. Prabhu, Elementary methods for Markov-modulated queueing system, Tech. Report No. 983, Cornell University, Ithaca, NY (1991).
N.U. Prabhu and Y. Zhu, Markov-modulated queueing systems, Queueing Systems 5 (1989) 215–245.
Y. Zhu, A Markov-modulated M/M/l queue with group arrivals, Queueing Systems 8 (1991) 255–264.
Y. Zhu and N.U. Prabhu, Markov-modulated PH/G/1 queueing systems, Queueing Systems 9 (1991) 313–322.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhu, Y., Li, H. The MacLaurin expansion for a G/G/1 queue with Markov-modulated arrivals and services. Queueing Syst 14, 125–134 (1993). https://doi.org/10.1007/BF01153530
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01153530