Abstract
For a closed queueing network with single-server nodes, we prove that if the total number of requests, the number of servers in one of the nodes, and service rates in all other nodes are made n times as large, then the stationary number of requests in the multiserver node divided by n converges in probability as n ? ? to a positive constant, determined by parameters of the original network, with geometric convergence rate. Single-server nodes in the constructed network can be interpreted as repair nodes, the multiserver node as a set of workplaces, and requests as elements in a redundancy-with-repair model.
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.
