HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Non-Cooperative Routing in Loss Networks

Abstract : The paper studies routing in loss networks in the framework of a non-cooperati- ve game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a finite number of agents (such as service providers) that take routing decisions, and the Wardrop equilibrium, in which routing decisions are taken by a very large number of individual users. We show that these equilibria do not fall into the standard frameworks of non-cooperative routing games. As a result, we show that uniqueness of equilibria or even of utilizations at equilibria may fail even in the case of simple topology of parallel links. However, we show that some of the problems disappear in the case in which the bandwidth required by of all connections is the same. For the special case of a parallel link topology, we obtain some surprisingly simple way of solving the equilibrium for both cases of Wardrop as well as Nash equilibrium.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:59:53 PM
Last modification on : Friday, February 4, 2022 - 3:16:02 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:57:24 PM


  • HAL Id : inria-00072183, version 1



Eitan Altman, Rachid El-Azouzi, Vyacheslav Abramov. Non-Cooperative Routing in Loss Networks. RR-4405, INRIA. 2002. ⟨inria-00072183⟩



Record views


Files downloads