Abstract
In this paper a method is stated to conclude that the output of given queueing system is POISSON from the steady-state probabilities and from the behavior of the queueing system at jump epochs, i.e. at epochs when the system state can be changed. The corresponding statement for queueing systems described by Markov processes with denumber-able state space will be generalized to systems which can have arbitrary service time distributions if the steady-state probabilities are insensitive with respect to these distributions.
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.
