Abstract

In this paper, we review some of the methods used to find the number of customers in system in an GI/M/c/N queue for finite and infinite buffer sizes N, and we add some new methods. It was found that with modern computers, most of these methods provide results in a fraction of a second, even for high values of c and N. We also show that the traditional methods for dealing with infinite buffers lead to double integrals, a problem that is avoided by using a novel method we suggest.

Full Text
Paper version not known

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 call

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.