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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
