Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 33, No. 1, February 2008, pp. 51-90
DOI: 10.1287/moor.1070.0277
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Tezcan, T.
Right arrow Search for Related Content

Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime

Tolga Tezcan

Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
ttezcan{at}uiuc.edu

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.

Key Words: large-scale service networks; scheduling and routing control; heavy traffic; quality and efficiency driven; distributed systems
History: Received: November 4, 2005; revision received: December 21, 2006;


This article has been cited by other articles:


Home page
Mathematics of Operations ResearchHome page
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]


Home page
Mathematics of Operations ResearchHome page
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
Copyright © 2008 by INFORMS.