A Dynamic Approach for Load Balancing

Dominique  Barth; Olivier  Bournez; Octave  Boussaton; Johanne  Cohen

3rd Workshop on Game Theory in Communication Networks

Research Article

A Dynamic Approach for Load Balancing

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/ICST.VALUETOOLS2009.7775,
    author={Dominique  Barth and Olivier  Bournez and Octave  Boussaton and Johanne  Cohen},
    title={A Dynamic Approach for Load Balancing},
    proceedings={3rd Workshop on Game Theory in Communication Networks},
    publisher={ACM},
    proceedings_a={GAMECOMM},
    year={2010},
    month={5},
    keywords={},
    doi={10.4108/ICST.VALUETOOLS2009.7775}
}

Dominique Barth
Olivier Bournez
Octave Boussaton
Johanne Cohen
Year: 2010
A Dynamic Approach for Load Balancing
GAMECOMM
ICST
DOI: 10.4108/ICST.VALUETOOLS2009.7775

Dominique Barth¹^,*, Olivier Bournez²^,*, Octave Boussaton³^,*, Johanne Cohen⁴^,*

1: Université de Versailles. Laboratoire PRiSM, 45, avenue des Etats-Unis, 78000 Versailles, FRANCE.
2: Ecole Polytechnique. Laboratoire LIX, 91128 Palaiseau Cedex, FRANCE.
3: LORIA, 615 Rue du Jardin Botanique, 54602 Villers-Lès-Nancy, FRANCE.
4: CNRS. Université de Versailles, 45, avenue des Etats-Unis, 78000 Versailles, FRANCE.

*Contact email: Dominique.Barth@prism.uvsq.fr, Olivier.Bournez@polytechnique.fr, Octave.Boussaton@loria.fr, Johanne.Cohen@prism.uvsq.fr

Abstract

We study how to reach a Nash equilibrium in a load balancing scenario where each task is managed by a selfish agent and attempts to migrate to a machine which will minimize its cost. The cost of a machine is a function of the load on it. The load on a machine is the sum of the weights of the jobs running on it. We prove that Nash equilibria can be learned on that games with incomplete information, using some Lyapunov techniques.

Published: 2010-05-16
Publisher: ACM
Modified: 2010-05-16

: http://dx.doi.org/10.4108/ICST.VALUETOOLS2009.7775