Debankur Mukherjee

Universality of load balancing schemes on the diffusion scale

We consider a system of

Optimal Service Elasticity in Large-Scale Distributed Systems

N

Universality of Power-of-d Load Balancing Schemes

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

Generalized Random Sequential Adsorption on Erdős–Rényi Random Graphs

(1 \leq d \leq N)

Efficient load balancing in large-scale systems

. This load balancing scheme subsumes the so-called Join-the-Idle Queue (JIQ) policy

Corrected Mean-Field Model for Random Sequential Adsorption on Random Geometric Graphs

(d = 1)

Universality of Power-of-

and the celebrated Join-the-Shortest Queue (JSQ) policy

d

(d = N)

Load Balancing in Many-Server Systems

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

Asymptotically Optimal Load Balancing Topologies

d