Abstract
We study anM/M/1 group arrival queue in which the arrival rate, service time distributions and the size of each group arrival depend on the state of an underlying finite-state Markov chain. Using Laplace transforms and matrix analysis, we derive the results for the queue length process, its limit distribution and the departure process. In some special cases, explicit results are obtained which are analogous to known classic results.
Similar content being viewed by others
References
N.U. Prabhu,Stochastic Storage Processes (Springer, New York, 1980).
N.U. Prabhu and Y. Zhu, Markov-modulated queueing systems, Queueing Systems 5 (1989) 215–246.
P. Purdue, TheM/M/1 queue in a Markovian environment, Oper. Res. 22 (1974) 562–569.
G.J.K. Regterschot and J.H.A. de Smit, The queueM/G/1 with Markov-modulated arrivals and service, Math. Oper. Res. 11 (1986) 465–483.
U. Yechiali, A queueing-type birth-and-death process defined on a continuous time Markov chain, Oper. Res. 21 (1973) 604–609.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhu, Y. A markov-modulated M/M/1 queue with group arrivals. Queueing Syst 8, 255–263 (1991). https://doi.org/10.1007/BF02412254
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02412254