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 math.PRShow all

23 papers · 1 filter

math.PR2026

Uniform-in-Time Boltzmann Mean-Field Limits for Anchored Binary Opinion Dynamics

Jingyi Zhang, Debankur Mukherjee

We study a continuous-time opinion model in which agents interact in pairs and each agent has a fixed anchor. At each interaction, both opinions are updated according to a possibly…

math.PR2026

Waning Immunity Fails to Restore a Positive Epidemic Threshold on Power-Law Networks

Zihao He, Souvik Dhara, Debankur Mukherjee

In a seminal work, Chatterjee and Durrett (2009) established that for the SIS epidemic process on random graphs with power-law degree distributions, the infection survives for an e…

math.PR2026

Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method

Bihan Chatterjee, Siva Theja Maguluri, Debankur Mukherjee

We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the…

math.PR2023★ 1 cited

Optimal Rate-Matrix Pruning For Large-Scale Heterogeneous Systems

Zhisheng Zhao, Debankur Mukherjee

We present an analysis of large-scale load balancing systems, where the processing time distribution of tasks depends on both the task and server types. Our study focuses on the as…

math.PR2023

Mean-field Analysis for Load Balancing on Spatial Graphs

Daan Rutten, Debankur Mukherjee

The analysis of large-scale, parallel-server load balancing systems has relied heavily on mean-field analysis. A pivotal assumption for this framework is that the servers are excha…

math.PR2022★ 3 cited

Exploiting Data Locality to Improve Performance of Heterogeneous Server Clusters

Zhisheng Zhao, Debankur Mukherjee, Ruoyu Wu

We consider load balancing in large-scale heterogeneous server systems in the presence of data locality that imposes constraints on which tasks can be assigned to which servers. Th…

math.PR2021★ 1 cited

Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window

Zhisheng Zhao, Sayan Banerjee, Debankur Mukherjee

The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analy…

math.PR2020

Load Balancing Under Strict Compatibility Constraints

Daan Rutten, Debankur Mukherjee

We study large-scale systems operating under the JSQ policy in the presence of stringent task-server compatibility constraints. Consider a system with identical single-ser…

math.PR2020

On -to- norms of random matrices with nonnegative entries: Asymptotic normality and -bounds for the maximizer

Souvik Dhara, Debankur Mukherjee, Kavita Ramanan

For an matrix , the operator norm is defined as $$\|A_n\|_{r\to p}:= \sup_{\mathbf{x}\in\mathbb{R}^n:\|\mathbf{x} \|_r\leq 1 } \|A_n\mathbf{x} \|_p\quad\t…

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)…

math.PR2017★ 28 cited

Supermarket Model on Graphs

Amarjit Budhiraja, Debankur Mukherjee, Ruoyu Wu

We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suit…

math.PR2017★ 29 cited

Asymptotically Optimal Load Balancing Topologies

Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden

We consider a system of servers inter-connected by some underlying graph topology . Tasks arrive at the various servers as independent Poisson processes of rate . Each…

math.PR2017★ 25 cited

Optimal Service Elasticity in Large-Scale Distributed Systems

Debankur Mukherjee, Souvik Dhara, Sem Borst +1

A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent use…

math.PR2016★ 16 cited

Asymptotic Optimality of Power-of- Load Balancing in Large-Scale Systems

Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden +1

We consider a system of identical server pools and a single dispatcher where tasks arrive as a Poisson process of rate . Arriving tasks cannot be queued, and must immedia…

math.PR2016★ 71 cited

Universality of Power-of- Load Balancing in Many-Server Systems

Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden +1

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

math.PR2016★ 3 cited

Corrected mean-field model for random sequential adsorption on random geometric graphs

Souvik Dhara, Johan S. H. van Leeuwaarden, Debankur Mukherjee

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the -dimensional Euclidean…

math.PR2016★ 7 cited

Generalized random sequential adsorption on Erdős-Rényi random graphs

Souvik Dhara, Johan S. H. van Leeuwaarden, Debankur Mukherjee

We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the vertices at random, and sequentially declare each vertex eithe…

math.PR2015★ 38 cited

Universality of Load Balancing Schemes on Diffusion Scale

D. Mukherjee, S. C. Borst, J. S. H. van Leeuwaarden +1

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 dispa…