Insensitive Load Balancing - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Insensitive Load Balancing

(1, 2) , (2) , (2, 1)
1
2

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.
Fichier principal
Vignette du fichier
sig04-rout.pdf (456.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01284237 , version 1 (07-03-2016)

Identifiers

  • HAL Id : hal-01284237 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More