Abstract
We consider the multiserver queueing system studied originally by L. Green (1980) in which customers request service from a random number of identical servers. We provide a matrix-geometric formulation of the problem, present a simple means for computing the stationary probability vector, and propose an algorithm based on randomization for computing the waiting time distribution. We also give a numerical example and discuss issues involved in extending the formulation to include customer priority classes.
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.
