Limiting distribution for infinite-server batch service queues
The authors consider an infinite-server (random) batch service queue with Poisson arrivals and establish a conditional central limit theorem (CLT) for the number of busy servers conditioned on the number of waiting customers and the size of the batch to be served. This result as a conjecture has been formulated (and partly verified) by \textit{A. Nakamura} and \textit{T. Phung-Duc} [Mathematics 11, No. 9, Paper No. 2088, 20 p. (2023; \url{doi:10.3390/math11092088})]. It is assumed that the arrival (Poisson) rate goes to infinity while the sizes of groups (batches) remain i.i.d. with a finite second moment. The authors study a basic Markov process describing the state of the system just after the initiation of a batch service. Moreover a LLN is also proved for the process. An extension of the conditional CLT to \(GI/M^X/\infty\) queues is also provided. In the proofs, Burke's theorem, property PASTA and some known asymptotic results by \textit{W. Whitt} [Adv. Appl. Probab. 14, 171--190 (1982; Zbl 0479.60090)] are used. Moreover, the following tools are used in the proofs: the characteristic functions, a regeneration property of the basic process, and stochastic comparisons.
This page was built for publication: Limiting distribution for infinite-server batch service queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025592)
