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, ENS Paris - École normale supérieure - Paris, 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.
Type de document :
Communication dans un congrès
ACM Sigmetrics, 2004, New York, United States. Proceedings of ACM Sigmetrics, 2004, Proceedings of ACM Sigmetrics
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01284237
Contributeur : Thomas Bonald <>
Soumis le : lundi 7 mars 2016 - 14:07:24
Dernière modification le : jeudi 29 septembre 2016 - 01:22:07
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 08:22:02

Fichier

sig04-rout.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. Proceedings of ACM Sigmetrics, 2004, Proceedings of ACM Sigmetrics. 〈hal-01284237〉

Partager

Métriques

Consultations de la notice

439

Téléchargements de fichiers

68