72 citations · 369 across the 34 of their papers we have counts for
34 papers
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…
Scaling Limits of Constant-Stepsize SGD at Flat Minima
Jingyi Zhang, Cheng Mao, Debankur Mukherjee
For stochastic gradient descent (SGD) with a constant stepsize , the invariant law of the iterates, centered at a minimizer, describes the behavior of the algorithm over long ti…
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…
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…
SCaLE: Switching Cost aware Learning and Exploration
Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman
This work addresses the fundamental problem of unbounded metric movement costs in bandit online convex optimization, by considering high-dimensional dynamic quadratic hitting costs…
Optimal Decentralized Smoothed Online Convex Optimization
Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman
We study the multi-agent Smoothed Online Convex Optimization (SOCO) problem, where agents interact through a communication graph. In each round, each agent receives a stron…
Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman
We study the smoothed online quadratic optimization (SOQO) problem where, at each round , a player plays an action in response to a quadratic hitting cost and an additiona…
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…
Distributed Rate Scaling in Large-Scale Service Systems
Daan Rutten, Martin Zubeldia, Debankur Mukherjee
We consider a large-scale parallel-server system, where each server independently adjusts its processing speed in a decentralized manner. The objective is to minimize the overall c…
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…
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…
Smoothed Online Optimization with Unreliable Predictions
Daan Rutten, Nico Christianson, Debankur Mukherjee +1
We examine the problem of smoothed online optimization, where a decision maker must sequentially choose points in a normed vector space to minimize the sum of per-round, non-convex…
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…
Online Capacity Scaling Augmented With Unreliable Machine Learning Predictions
Daan Rutten, Debankur Mukherjee
Modern data centers suffer from immense power consumption. As a result, data center operators have heavily invested in capacity scaling solutions, which dynamically deactivate serv…
Self-Learning Threshold-Based Load Balancing
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden +2
We consider a large-scale service system where incoming tasks have to be instantaneously dispatched to one out of many parallel server pools. The user-perceived performance degrade…
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…
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…
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…
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)…
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…
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…
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…
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)…
Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods
Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden +1
We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead.…