Computational analysis of \(GI^{[X]}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization (Q6046970): Difference between revisions

The paper under review studies a single server queueing system with batch arrivals and batch services. The number of waiting places is infinite. The times between arrivals are generally distributed. Customers are served due to the discrete time Markovian process in accordance with general bulk service rule. The paper derives vector valued state probabilities immediately before arrival of a batch of customers. For this purpose, the paper uses UL-type RG-factorization method based on censoring technique. The random epoch probability vectors are then obtained by using the Markov renewal theory on the basis of the earlier obtained vector of the state probabilities before arrival of a batch of customers. The paper also derives simple expressions for the outside observer's, intermediate, and post-departure epochs probability vectors by evolving the relationships among them. Numerical results of the paper have been discussed.