Abstract
Several simple queueing models, commonly used as textbook examples, have explicit steady-state solutions, which to date have escaped notice. These solutions are easily computable. In addition to their didactic interest, the results presented here are also useful in the analysis of more complex queueing models.
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.
