Routing Games on a Circle

Abstract : Rings are quite common in both road traffic networks as well as in telecommunication networks. In the road traffic context, we often find rings surrounding towns and cities. Traffic over these rings is either bidirectional or we may find two rings that surround the town carrying traffic in opposite directions (clockwise and anti-clockwise). Telecommunication networks based on rings have been often used both as local area networks as well as in metropolitan area networks and here too we find both bidirectional networks as well as networks consisting of two rings carrying traffic in opposite directions. Each decision maker (e.g. the drivers, in the case of road traffic, and perhaps Internet access providers, in the case of telecommunication) is faced with a simple routing decision: whether to go clockwise or anti-clockwise. Assuming a simple source-destination demand matrix, we analyze this problem as a non-cooperative game and derive several interesting characteristics of the equilibria.
Type de document :
Communication dans un congrès
Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011
Liste complète des métadonnées

https://hal.inria.fr/hal-00644364
Contributeur : Ist Rennes <>
Soumis le : jeudi 24 novembre 2011 - 11:55:48
Dernière modification le : samedi 27 janvier 2018 - 01:31:44
Document(s) archivé(s) le : lundi 5 décembre 2016 - 08:15:16

Fichier

11-PID2134907.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00644364, version 1

Collections

Citation

Eitan Altman, Alejandra Estanislao, Manoj Panda. Routing Games on a Circle. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011. 〈hal-00644364〉

Partager

Métriques

Consultations de la notice

227

Téléchargements de fichiers

163