Insensitive Load Balancing

Thomas Bonald 1, 2 Matthieu Jonckheere 2 Alexandre Proutière 2, 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : A large variety of communication systems, including telephone and data networks, can be represented by so-called Whittle networks. The stationary distribution of these networks is insensitive, depending on the service requirements at each node through their mean only. These models are of considerable practical interest as derived engineering rules are robust to the evolution of traffic characteristics. In this paper we relax the usual assumption of static routing and address the issue of dynamic load balancing. Specifically, we identify the class of load balancing policies which preserve insensitivity and characterize optimal strategies in some specific cases. Analytical results are illustrated numerically on a number of toy network examples.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01284237
Contributor : Thomas Bonald <>
Submitted on : Monday, March 7, 2016 - 2:07:24 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on : Sunday, November 13, 2016 - 8:22:02 AM

File

sig04-rout.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01284237, version 1

Collections

Citation

Thomas Bonald, Matthieu Jonckheere, Alexandre Proutière. Insensitive Load Balancing. ACM Sigmetrics, 2004, New York, United States. ⟨hal-01284237⟩

Share

Metrics

Record views

542

Files downloads

216