Extending Routing Games to Flows over Time

Abstract : Routing game presents an interesting framework to analyze 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 :
Pré-publication, Document de travail
RRLIP2009-17. 2009
Liste complète des métadonnées

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

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00383918
Contributeur : Sebastien Soudan <>
Soumis le : mercredi 13 mai 2009 - 20:15:32
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : lundi 15 octobre 2012 - 10:17:12

Fichier

RR-lip.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : ensl-00383918, version 1

Collections

Citation

Sébastien Soudan, Dinil Mon Divakaran, Eitan Altman, Pascale Vicat-Blanc Primet. Extending Routing Games to Flows over Time. RRLIP2009-17. 2009. 〈ensl-00383918〉

Partager

Métriques

Consultations de la notice

233

Téléchargements de fichiers

99