activity
20152026
most citedScalable load balancing in networked systems: A survey of recent advances

72 citations · 369 across the 34 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

math.PR2018★ 1 cited

Scalable Load Balancing Algorithms in Networked Systems

Debankur Mukherjee

A fundamental challenge in large-scale networked systems viz., data centers and cloud networks is to distribute tasks to a pool of servers, using minimal instantaneous state inform…

math.PR2018★ 15 cited

Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Sensitivity on the Heavy-traffic Parameter

Sayan Banerjee, Debankur Mukherjee

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

math.PR2018★ 72 cited

Scalable load balancing in networked systems: A survey of recent advances

Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden +1

The basic load balancing scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one of single-server queues. We discuss recent advances…

math.PR2018★ 11 cited

Join-Idle-Queue with Service Elasticity: Large-Scale Asymptotics of a Non-monotone System

Debankur Mukherjee, Alexander Stolyar

We consider the model of a token-based joint auto-scaling and load balancing strategy, proposed in a recent paper by Mukherjee, Dhara, Borst, and van Leeuwaarden (SIGMETRICS '17, a…

math.PR2018

Large deviations analysis for the queue in the Halfin-Whitt regime

David A. Goldberg, Debankur Mukherjee, Yuan Li

We consider the FCFS queue in the Halfin-Whitt heavy traffic regime. It is known that the normalized sequence of steady-state queue length distributions is tight and…

math.PR2018★ 25 cited

Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Tail Asymptotics and Scaling of Extrema

Sayan Banerjee, Debankur Mukherjee

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