Abstract
In this paper, we study the distribution of the busy period for a queue with Poisson input, in which the customers are served m at the time if there are m or more present and all at once if there are less than m present. We show that the busy period is equal to the time between successive visits to the state 0 in an imbedded semi-Markov process, associated with the queuing process. Extending an argument of L. Takács for the M/G/1 queue, we obtain the transform of the distribution of the busy period. Explicit expressions in real time may in principle be obtained, using Lagrange's expansion.
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 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.
