Abstract
Burke [Burke, P. J. 1956. The output of a queueing system. Oper. Res. 4 699–704.] showed that the departure process from an M/M/1 queue with infinite capacity was in fact a Poisson process. Using methods from semi-Markov process theory, this paper extends this result by determining that the departure process from an M/G/1 queue is a renewal process if and only if the queue is in steady state and one of the following four conditions holds: (1) the queue is the null queue—the service times are all 0; (2) the queue has capacity (excluding the server) 0; (3) the queue has capacity 1 and the service times are constant (deterministic); or (4) the queue has infinite capacity and the service times are negatively exponentially distributed (M/M/1/∞ queue).
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.
