A routing game in networks with lossy links

Abstract : 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.
Type de document :
Communication dans un congrès
7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP 2014), Oct 2014, Trento, Italy. 2014
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01066453
Contributeur : Eitan Altman <>
Soumis le : samedi 20 septembre 2014 - 14:19:48
Dernière modification le : samedi 27 janvier 2018 - 01:31:41
Document(s) archivé(s) le : dimanche 21 décembre 2014 - 10:15:24

Fichier

f1.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01066453, version 1

Collections

Citation

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. 2014. 〈hal-01066453〉

Partager

Métriques

Consultations de la notice

513

Téléchargements de fichiers

174