Abstract
In this paper we analyse the routing of customers in a general closed queuing network which satisfies a product‐form assumption. We prove that there are optimal deterministic routing rules, and we provide an algorithm to compute a Nash equilibrium point of the stochastic game in which the players are the customers. Constrained optimal routing rules are also considered.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
