Graph searching games for the WDM reconfiguration problem

David Coudert 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The routing reconfiguration problem in WDM networks is to schedule the switching's of a set of lightpaths from one routing to a new predetermined one. This problem is modeled as a digraph processing game, closely related to graph searching games, in which a team of agents is aiming at clearing, or processing, the vertices of a digraph. In this talk, we will survey the main results on digraph processing games, and in particular the complexity and hardness of optimizing tradeoffs between the total number of agents used and the total number of vertices occupied by an agent during the strategy.
Type de document :
Communication dans un congrès
24th European Conference on Operational Research (EURO), Jul 2010, Lisbon, Portugal. 2010
Liste complète des métadonnées

https://hal.inria.fr/inria-00482113
Contributeur : David Coudert <>
Soumis le : dimanche 9 mai 2010 - 00:06:43
Dernière modification le : lundi 23 avril 2018 - 10:52:05

Identifiants

  • HAL Id : inria-00482113, version 1

Collections

Citation

David Coudert. Graph searching games for the WDM reconfiguration problem. 24th European Conference on Operational Research (EURO), Jul 2010, Lisbon, Portugal. 2010. 〈inria-00482113〉

Partager

Métriques

Consultations de la notice

243