A Heavy Traffic Approximation for Queues with Restricted Customer-Server Matchings
25 Pages Posted: 3 Nov 2008
Date Written: 2007
We consider a queuing system with n customer classes and m servers. For eachclass i there is only a subset S(i) of servers that are able to process customer' i requests and they do that using a first-come-first-serve discipline. For this system, we are primarily interested in computing Pij , the steady-state fraction of class-i customers that are served by server j. We also look at stability conditions and standard performance measures like waiting times and queue lengths. Under the assumption that the system is heavy loaded, we approximate Pij as well as the other performance measures. Computational experiments are used to show the quality of our approximations.
Suggested Citation: Suggested Citation