A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GI ^{[X]}/C- MSP /1/infinity

• Published in: Annals of operations research Vol. 252; no. 1; p. 135
• Main Authors: Chaudhry, M L, Banik, A D, Pacheco, A
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.05.2017
• Subjects: Approximation; Customer services; Markov analysis; Operations research; Probability; Queuing; Random variables; Studies
• ISSN: 0254-5330; 1572-9338
• DOI: 10.1007/s10479-015-2026-y

We consider a batch arrival infinite-buffer single-server queue with generally distributed inter-batch arrival times with arrivals occurring in batches of random sizes. The service process is correlated and its structure is governed by a Markovian service process in continuous time. The proposed analysis is based on roots of the associated characteristic equation of the vector-generating function of system-length distribution at a pre-arrival epoch. We also obtain the steady-state probability distribution at an arbitrary epoch using the classical argument based on Markov renewal theory. Some important performance measures such as the average number of customers in the system and the mean sojourn time have also been obtained. Later, we have established heavy- and light-traffic approximations as well as an approximation for the tail probabilities at pre-arrival epoch based on one root of the characteristic equation. Numerical results for some cases have been presented to show the effect of model parameters on the performance measures.