A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\) (Q2826663)

The paper investigates \(\mathrm{GI}/\mathrm{C-MSP}^{(a,b)}/1/\infty \) queues. In such queues, customers are served by a single server in batches of maximum size \(b\) with a minimum threshold size \(a\). From the introduction: ``We carry out the analytic analysis through the calculation of roots of the denominator of the underlying generating function for the steady state probabilities of the embedded Markov chain after a particular threshold level for infinite state space. The roots can be easily found using one of the several commercially available packages. The purpose of studying this queueing model using roots is that we obtain computationally simple and analytically closed form solution to the infinite buffer \(\mathrm{GI}/\mathrm{C-MSP}^{(a,b)}/1\) queue. Secondly, we obtain several other quantitative measures such as queue-length distributions, evaluation of expected busy and idle period. Further, we provide a comparison between the computational complexities of the roots method and matrix-geometric method. Also, we have established heavy- and light-traffic approximations as well as approximation for the tail probabilities at the pre-arrival epoch based on the root of the characteristic equation.''