Journal of Applied Probability
- J. Appl. Probab.
- Volume 53, Number 4 (2016), 1111-1124.
Universality of load balancing schemes on the diffusion scale
We consider a system of N 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 d randomly selected servers otherwise (1≤d≤N). This load balancing scheme subsumes the so-called join-the-idle queue policy (d=1) and the celebrated join-the-shortest queue policy (d=N) 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 d, implying that assigning tasks to idle servers is sufficient for diffusion level optimality.
J. Appl. Probab., Volume 53, Number 4 (2016), 1111-1124.
First available in Project Euclid: 7 December 2016
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 60K25: Queueing theory [See also 68M20, 90B22] 68M20: Performance evaluation; queueing; scheduling [See also 60K25, 90Bxx]
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) [See also 90Bxx] 90B18: Communication networks [See also 68M10, 94A05] 90B36: Scheduling theory, stochastic [See also 68M20]
Mukherjee, Debankur; Borst, Sem C.; van Leeuwaarden, Johan S. H.; Whiting, Philip A. Universality of load balancing schemes on the diffusion scale. J. Appl. Probab. 53 (2016), no. 4, 1111--1124. https://projecteuclid.org/euclid.jap/1481132840