A New p-Cycle Selection Approach Based on Efficient Restoration Measure for WDM Optical Networks

The study of protection against failures in WDM optical networks plays strategic importance due to huge bandwidth of optical fiber. The p-Cycle is a novel protection approach based on pre-configured cycles to provide a fast recovery for single link failure. The optimal selection of cycles is the central problem to get a high protection performance of p-Cycle approach. In that sense, the importance of the length of a cycle for fast restoration is studied in this paper, because it affects directly the quality of restoration, therefore, the quality-of-service can be affected. This paper proposes a new heuristic approach and a new evaluation metric to solve the p-Cycle protection problem which simultaneously optimizes cost, protection, length and fairness of solutions in a mono-objective approach. Experimental results show a good performance of the heuristic proposed, when is compared with a recent Genetic Algorithms approach and the state-of-the-art ILP method.

[1]  Wayne Grover,et al.  Network Restorability Design Using Pre-configured Trees, Cycles, and Mixtures of Pattern Types , 2000 .

[2]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[3]  T. Cinkler,et al.  P-cycle based protection schemes for multi-domain networks , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[4]  Oliver W. W. Yang,et al.  Finding protection cycles in DWDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5]  Arun Kumar Somani.  A single-fault recovery strategy for optical networks using subgraph routing , 2002 .

[6]  Daryoush Habibi,et al.  A Hybrid p-Cycle Search Algorithm for Protection in WDM Mesh Networks , 2006, 2006 14th IEEE International Conference on Networks.

[7]  Achim Autenrieth,et al.  Optimal configuration of p-cycles in WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  Chang Liu,et al.  Finding good candidate cycles for efficient p-cycle network design , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[9]  Arun Somani.  Survivability and Traffic Grooming in WDM Optical Networks: Validation of the TSN model , 2006 .

[10]  Wayne D. Grover,et al.  Approaches to p-cycle network design with controlled optical path lengths in the restored network state , 2008 .

[11]  Zhizhong Zhang,et al.  P-cycle-based protection design for IP over WDM networks , 2004, SPIE/OSA/IEEE Asia Communications and Photonics.

[12]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

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

[14]  C. Colman,et al.  Optimal Selection of-Cycle for Optical Networks . An approach based on Genetic Algorithm , 2009 .

[15]  John A. Copeland,et al.  Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[16]  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).

[17]  Wayne D. Grover,et al.  The threshold hop-limit effect in p , 2005, Opt. Switch. Netw..