Finding protection cycles in DWDM networks

We introduce the problem of mesh optical network protection based on multiple logical ring/cycles. A two-staged problem formulation as well as classical ring finding algorithms are first discussed. A state-of-art protection cycle (p-cycle) finding algorithm is then proposed. This algorithm is scalable and especially suitable for sparse mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.

[1]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[2]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[3]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[4]  R. C. Lau,et al.  A class of self-healing ring architectures for SONET network applications , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[5]  G. D. Morley,et al.  COMPARISON OF MATHEMATICAL PROGRAMMING APPROACHES TO OPTICAL RING NETWORK DESIGN , 1999 .

[6]  W.D. Grover,et al.  Current approaches in the design of ring-based optical networks , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).

[7]  Ioannis G. Tollis,et al.  Techniques for finding ring covers in survivable networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[8]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[9]  Mark Allen.  IP over DWDM , 2003 .

[10]  Muriel Médard,et al.  A novel approach to automatic protection switching using trees , 1997, Proceedings of ICC'97 - International Conference on Communications.

[11]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[12]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[13]  Jacques Cohen,et al.  Non-Deterministic Algorithms , 1979, CSUR.

[14]  Biswanath Mukherjee,et al.  Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..

[15]  Demetrios Stamatelakis,et al.  Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks , 1997 .