Abstract
Nakamura and Phung-Duc (2023) conjectured that, for an infinite-server batch service queue with Poisson arrivals, the central limit theorem for the number of busy servers, conditioned on the number of waiting customers and the size of the batch to be served, holds as the arrival rate goes to infinity. In this paper, we resolve this conjecture using the theory of Markov regenerative processes and further extend the result to renewal arrival models.
Original language | English |
---|---|
Article number | 110327 |
Journal | Statistics and Probability Letters |
Volume | 219 |
DOIs | |
Publication status | Published - 2025 Apr |
Bibliographical note
Publisher Copyright:© 2024 Elsevier B.V.
Keywords
- Central limit theorem
- Infinite server queue
- Law of large numbers
- Markov regenerative processes
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty