In this survey we provide an overview of recent advances on scalable load balancing
schemes which provide favorable delay performance and yet require minimal …

We consider a system of N parallel single-server queues with unit exponential service rates
and a single dispatcher where tasks arrive as a Poisson process of rate λ (N). When a task …

Applications in cloud platforms motivate the study of efficient load balancing under job-
server constraints and server heterogeneity. In this paper, we study load balancing on a …

We analyze join-the-shortest-queue (JSQ) in a contemporary scaling regime known as the
nondegenerate slowdown (NDS) regime. Join-the-shortest-queue is a classical load …

Consider a system of N parallel single-server queues with unit-ex ponential service time
distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ(N) …

We study a class of load-balancing algorithms for many-server systems (N servers). Each
server has a buffer of size (ra positive integer). The proof of the main result is based on the …

The drift method was recently developed to study queuing systems in steady state. It was
used successfully to obtain bounds on the moments of the scaled queue lengths that are …

Abstract The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise
the average delay of jobs in homogeneous systems consisting of identical servers. However …

We study a load balancing system in the many-server heavy-traffic regime. We consider a
system with N servers, where jobs arrive to the system according to a Poisson process and …

This paper studies load balancing for many‐server (N servers) systems. Each server has a
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …