Abstract
The finite capacity queues, GI/PH/1/N and PH/G/1/N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of service rule, we study this finite capacity queueing model in detail by obtaining explicit expressions for (a) the steady-state queue length densities at arrivals, at departures and at arbitrary time points, (b) the probability distributions of the busy period and the idle period of the server and (c) the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures when services are of phase type are discussed. An illustrative numerical example is presented.
Similar content being viewed by others
References
S. Chakravarthy, A finite capacity GI/PH/1 queue with group services, Naval Research Logistics 39 (1992) 345–357.
S. Chakravarthy, A finite capacity queueing model with phase type arrivals and general (group) services, submitted for publication.
D.M. Lucantoni and V. Ramaswami, Efficient algorithms for solving non-linear matrix equations arising in phase type queues, Stochastic Models 1 (1985) 29–52.
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1–46.
M.F. Neuts, A versatile Markovian point process, J. Appl. Prob. 16 (1979) 764–779.
M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach (Johns Hopkins University Press, Baltimore, MD, 1981).
M.F. Neuts,Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chakravarthy, S. Analysis of a finite MAP/G/1 queue with group services. Queueing Syst 13, 385–407 (1993). https://doi.org/10.1007/BF01149262
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01149262