Abstract
In the paper a central limit theorem for the total busy time of a Markovian queuing system is proved (provided that the system satisfies some simple assumptions), This is based on a stochastic convergence theorem for the average number of services. The latter is presented in a form of “law of large numbers” as well. The case of bounded queue length is particularly analysed.
Sign-in/Register to access full text options 
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 callMore From: Mathematische Operationsforschung und Statistik. Series Optimization
Disclaimer: 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.
