Rerouting requests in WDM networks

We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then present a distributed linear-time algorithm to solve the problem on trees. Last we give the solutions for some classes of graphs, in particular complete d -ary trees and grids.

[1]  Lali Barrière,et al.  Capture of an intruder by mobile agents , 2002, SPAA '02.

[2]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[5]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[6]  Michael A. Langston,et al.  Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[8]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[9]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[10]  Konstantin Skodinis.  Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time , 2003, J. Algorithms.