A routing game in networks with lossy links - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A routing game in networks with lossy links


Standard assumptions in the theory of routing games are that costs are additive over links and that there is flow conservation. The assumptions typically hold when the costs represent delays. We introduce here a routing game where losses occur on links in a way that may depend on the congestion. In that case both assumptions fail. We study a load balancing network and identify a Kameda type paradox in which by adding capacity, all players suffer larger loss rates.
Fichier principal
Vignette du fichier
f1.pdf (217.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01066453 , version 1 (20-09-2014)


  • HAL Id : hal-01066453 , version 1


Eitan Altman, Joy Kuri, Rachid El-Azouzi. A routing game in networks with lossy links. 7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP 2014), Oct 2014, Trento, Italy. ⟨hal-01066453⟩
437 View
156 Download


Gmail Facebook Twitter LinkedIn More