Graph searching games for the WDM reconfiguration problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Graph searching games for the WDM reconfiguration problem

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.
No file

Dates and versions

inria-00482113 , version 1 (09-05-2010)

Identifiers

  • HAL Id : inria-00482113 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More