Extending Routing Games to Flows over Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2009

Extending Routing Games to Flows over Time

Résumé

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.

Mots clés

Fichier principal
Vignette du fichier
RR.pdf (221.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00383573 , version 1 (13-05-2009)

Identifiants

  • HAL Id : inria-00383573 , version 1

Citer

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⟩
264 Consultations
77 Téléchargements

Partager

Gmail Facebook X LinkedIn More