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
Conference papers

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 , Laboratoire I3S - 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.
Complete list of metadata

Contributor : David Coudert Connect in order to contact the contributor
Submitted on : Sunday, May 9, 2010 - 12:06:43 AM
Last modification on : Friday, February 4, 2022 - 3:19:54 AM


  • HAL Id : inria-00482113, version 1



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



Record views