Extending Routing Games to Flows over TimeReport as inadecuate

Extending Routing Games to Flows over Time - Download this document for free, or read online. Document in PDF available to download.

1 LIP - Laboratoire de l-Informatique du Parallélisme 2 RESO - Protocols and softwares for very high-performance network Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l-Informatique du Parallélisme 3 MAESTRO - Models for the performance analysis and the control of networks CRISAM - Inria Sophia Antipolis - Méditerranée

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

Author: Sébastien Soudan - Dinil Mon Divakaran - Eitan Altman - Pascale Vicat-Blanc Primet -

Source: https://hal.archives-ouvertes.fr/


Related documents