Abstract
Using recently developed Matrix-Algebraic techniques, we find explicit steady-state solutions of M/G/C/ /N-type loops that depend on a set of recursively defined matrices. We show that such systems are special cases of arbitrary service centers that contain (load dependent) exponential servers in which no more than C customers can be active simultaneously. We also outline a recursive algorithm that can be used to evaluate the properties of small- to moderate-sized systems. The solution to the M/G/C open system is then found by letting the overall customer population N go to infinity. The solutions for closed systems in general are not of the matrix geometric type, and only in the limit does the solution become geometric in form.
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.
