Extending Routing Games to Flows over Time - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Extending Routing Games to Flows over Time

(1, 2) , (1, 2) , (3) , (1, 2)
1
2
3

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

Fichier principal
Vignette du fichier
RR-lip.pdf (358.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00383918 , version 1 (13-05-2009)

Identifiers

  • HAL Id : ensl-00383918 , version 1

Cite

Sébastien Soudan, Dinil Mon Divakaran, Eitan Altman, Pascale Vicat-Blanc Primet. Extending Routing Games to Flows over Time. 2009. ⟨ensl-00383918⟩
105 View
74 Download

Share

Gmail Facebook Twitter LinkedIn More