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 2016Show all

6 papers · 1 filter

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.CO2016★ 3 cited

Phase transitions of extremal cuts for the configuration model

Souvik Dhara, Debankur Mukherjee, Subhabrata Sen

The -section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree dist…

cs.DM2016★ 10 cited

Independent Set Reconfiguration Thresholds of Hereditary Graph Classes

Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee

Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps th…

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…