Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

Abstract As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

[1]  Feng Zhang,et al.  Applying p-Cycles in Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Networks , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[2]  Kamran Zamanifar,et al.  Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem , 2012, ArXiv.

[3]  Lei Guo,et al.  Enhanced Hamiltonian Cycle Protection Algorithm in Survivable Networks , 2008, 2008 International Conference on Signal Processing, Communications and Networking.

[4]  Biswanath Mukherjee,et al.  Dynamic provisioning of survivable multicast sessions in optical WDM mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[5]  Dominic A. Schupke,et al.  On Hamiltonian cycles as optimal p-cycles , 2005, IEEE Communications Letters.

[6]  Cai Lu,et al.  A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks , 2006 .

[7]  Lei Guo,et al.  A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks , 2008, Comput. Commun..

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

[9]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[10]  Lemin Li,et al.  On Protecting Dynamic Multicast Sessions in Survivable Mesh WDM Networks , 2006, 2006 IEEE International Conference on Communications.

[11]  Biswanath Mukherjee,et al.  Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks , 2006, Comput. Networks.

[12]  G. Ellinas,et al.  Protection of multicast sessions in WDM mesh optical networks , 2005, OFC/NFOEC Technical Digest. Optical Fiber Communication Conference, 2005..

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[14]  Biswanath Mukherjee,et al.  Backup reprovisioning to remedy the effect of multiple link failures in WDM mesh networks , 2006, IEEE Journal on Selected Areas in Communications.

[15]  Lei Guo.  Heuristic Survivable Routing Algorithm for Multiple Failures in WDM Networks , 2007, 2007 2nd IEEE/IFIP International Workshop on Broadband Convergence Networks.

[16]  Biswanath Mukherjee,et al.  Protecting multicast sessions in WDM optical mesh networks , 2003 .

[17]  Lei Guo,et al.  Multicast protection scheme based on Hamiltonian cycle in fault-tolerant optical mesh networks , 2010 .

[18]  Lei Guo,et al.  A New Link-Based Hamiltonian Cycle Protection in Survivable WDM Optical Networks , 2008, 2008 Fourth Advanced International Conference on Telecommunications.

[19]  Biswanath Mukherjee,et al.  Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks , 2003 .

[20]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[21]  John A. Copeland,et al.  Multi-domain mesh optical network protection using Hamiltonian cycles , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[22]  Yaohui Jin,et al.  Optimizations of $p$-Cycle-Based Protection of Optical Multicast Sessions , 2008, Journal of Lightwave Technology.

[23]  Nasir Ghani,et al.  Analysis of capacity re-provisioning in optical mesh networks , 2005, IEEE Communications Letters.

[24]  Hanyi Zhang,et al.  An Improved Approach for Online Backup Reprovisioning Against Double Near-Simultaneous Link Failures in Survivable WDM Mesh Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[25]  L. Wuttisittikulkij,et al.  Design and analysis of five protection schemes for preplanned recovery in multicast WDM networks , 2004, 2004 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communications.

[26]  Biswanath Mukherjee,et al.  Optical WDM Networks , 2006 .

[27]  Massimo Tornatore,et al.  Improving Efficiency of Backup Reprovisioning in WDM Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.