Extending Routing Games to Flows over Time

Abstract : Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior that results in any transportation network without any central authority. This game assumes that the only user criteria for decision making is path cost. In this work, we take a step further, and model a routing game where user decision is based not only on path but also on time. We show that, under convex cost functions, this new routing game over time can be mapped to the classical routing game, thereby presenting a model that can exploit well-established results in the subject. Using a simple example, we demonstrate the usefulness of the model, and motivate the need for resource coordination to minimize inefficiency or cost.
Keywords : Routing games
Type de document :
[Research Report] RR-6931, INRIA. 2009
Liste complète des métadonnées

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

Contributeur : Dinil Mon Divakaran <>
Soumis le : mercredi 13 mai 2009 - 10:51:56
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : lundi 15 octobre 2012 - 10:16:33


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00383573, version 1



Sébastien Soudan, Dinil Mon Divakaran, Eitan Altman, Pascale Primet. Extending Routing Games to Flows over Time. [Research Report] RR-6931, INRIA. 2009. 〈inria-00383573〉



Consultations de la notice


Téléchargements de fichiers