Universality of Load Balancing Schemes on Diffusion Scale
Abstract
We consider a system of parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among randomly selected servers otherwise . This load balancing scheme subsumes the so-called Join-the-Idle Queue (JIQ) policy and the celebrated Join-the-Shortest Queue (JSQ) policy as two crucial special cases. We develop a stochastic coupling construction to obtain the diffusion limit of the queue process in the Halfin-Whitt heavy-traffic regime, and establish that it does not depend on the value of , implying that assigning tasks to idle servers is sufficient for diffusion level optimality.
Cite
@article{arxiv.1510.02657,
title = {Universality of Load Balancing Schemes on Diffusion Scale},
author = {D. Mukherjee and S. C. Borst and J. S. H. van Leeuwaarden and P. A. Whiting},
journal= {arXiv preprint arXiv:1510.02657},
year = {2016}
}