A Heavy Traffic Approximation for Queues with Restricted Customer-Server Matchings

25 Pages Posted: 3 Nov 2008

See all articles by René A. Caldentey

René A. Caldentey

affiliation not provided to SSRN

Edward H. Kaplan

Yale School of Management

Date Written: 2007

Abstract

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

Caldentey, René A. and Kaplan, Edward H., A Heavy Traffic Approximation for Queues with Restricted Customer-Server Matchings (2007). Operations Management Working Papers Series, Vol. , pp. -, 2007. Available at SSRN: https://ssrn.com/abstract=1293130

René A. Caldentey (Contact Author)

affiliation not provided to SSRN

No Address Available

Edward H. Kaplan

Yale School of Management ( email )

135 Prospect Street
P.O. Box 208200
New Haven, CT 06520-8200
United States
203-432-6031 (Phone)

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
62
Abstract Views
487
rank
364,125
PlumX Metrics