#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
- FSTTCS
- 2016

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 that preserve feasibility of the intermediate solutions. In this paper, rather than asking this question from an algorithmic perspective, we analyze the combinatorial structure… (More)

- Debankur Mukherjee, Sem C. Borst, Johan van Leeuwaarden, Phil Whiting
- SIGMETRICS Performance Evaluation Review
- 2016

We consider a system of <i>N</i> parallel queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate λ(<i>N</i>). When a task arrives, the dispatcher assigns it to a server with the shortest queue among <i>d</i>(<i>N</i>) ≤ <i>N</i> randomly selected servers. This load balancing policy is… (More)

- Debankur Mukherjee, Sem C. Borst, Johan van Leeuwaarden, Philip A. Whiting
- J. Applied Probability
- 2016

- Debankur Mukherjee, Souvik Dhara, Sem C. Borst, Johan van Leeuwaarden
- SIGMETRICS
- 2017

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 user-perceived performance in the presence of uncertain and time-varying demand patterns. Auto-scaling provides a popular paradigm for automatically adjusting service capacity in… (More)

- Debankur Mukherjee, Sem C. Borst, Johan van Leeuwaarden, Philip A. Whiting
- 2016 Annual Conference on Information Science and…
- 2016

We consider a system of N identical parallel server pools and a single dispatcher where tasks arrive as a Poisson process. Arriving tasks cannot be queued, and must immediately be assigned to one of the server pools to start execution. The execution times are assumed to be exponentially distributed, and do not depend on the number of tasks contending for… (More)

- Souvik Dhara, Debankur Mukherjee, Subhabrata Sen
- ArXiv
- 2016

The k-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 distribution. These transitions mirror those observed on Erdős-Rényi random graphs, established by Luczak and McDiarmid (2001), and Coppersmith et al. (2004), respectively.

- K V S Hari Kumar, S Priya, D Mukherjee
- Nigerian journal of clinical practice
- 2012

- Debankur Mukherjee, Sem C. Borst, Johan van Leeuwaarden
- ArXiv
- 2017

<lb>We consider a system of N servers inter-connected by some underlying graph topol-<lb>ogy GN. Tasks arrive at the various servers as independent Poisson processes of rate λ. Each<lb>incoming task is irrevocably assigned to whichever server has the smallest number of tasks<lb>among the one where it appears and its neighbors in GN. Tasks have independent… (More)

- ‹
- 1
- ›