Dynamic routing of customers with general delay costs in a multiserver queuing system
Probability in the Engineering and Informational Sciences
Queue-and-Idleness-Ratio Controls in Many-Server Service Systems
Mathematics of Operations Research
Exploiting Market Size in Service Systems
Manufacturing & Service Operations Management
State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
Mathematics of Operations Research
Centralized vs. Decentralized Ambulance Diversion: A Network Perspective
Management Science
Exploiting network effects in the provisioning of large scale systems
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
| Hi-index | 0.00 |
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.