|
|
||||||||
Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
We consider a distributed parallel server system that consists of multiple server pools and a single customer class. We show that the minimum-expected-delay faster-server-first (MED-FSF) routing policy asymptotically minimizes the stationary distribution of the total queue length and the stationary delay probability in the Halfin and Whitt regime. We propose the minimum-expected-delay load-balancing (MED-LB) routing policy to balance the utilizations of all the servers in a distributed system with no unnecessary idling. We show that this policy balances both the long-run and finite-time average utilizations over all the server pools in the Halfin and Whitt regime. We next show that, under either the MED-FSF or the MED-LB policy, a distributed system performs as well as the corresponding inverted V-system. Finally, we show that, operating under the MED-LB policy, both the distributed system and the inverted V-system have similar performances to a corresponding M/M/n system. We illustrate the quality of our asymptotic results for several parallel server systems via simulation experiments.
ttezcan{at}uiuc.edu
History: Received: November 4, 2005;
revision received: December 21, 2006;
This article has been cited by other articles:
![]() |
I. Gurvich and W. Whitt Queue-and-Idleness-Ratio Controls in Many-Server Service Systems Mathematics of Operations Research, May 1, 2009; 34(2): 363 - 396. [Abstract] [PDF] |
||||
![]() |
A. Mandelbaum and P. Momcilovic Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime Mathematics of Operations Research, August 1, 2008; 33(3): 561 - 586. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |