Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks

Maintaining survivability of DWDM networks is crucial to multicast traffic. A link-or-node failure has a severe impact on optical multicast sessions as it can prune several communications simultaneously. In this paper, we present a novel candidate-cycle-based heuristic algorithm for node-and-link protection (CCHN) in dynamic multicast traffic. CCHN is based on p-cycle protection concept. The p-cycle concept ensures a fast restoration time and an efficient use of network capacity. Extensive simulations show that the blocking probability of our algorithm is lowest. Furthermore, the computational time of our algorithm is very low compared with the existing approaches, especially when traffic load is high.

[1]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

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

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

[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]  Feng Zhang,et al.  ρp-Cycle based tree protection of optical multicast traffic for combined link and node failure recovery in WDM mesh networks , 2009, IEEE Commun. Lett..

[6]  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.

[7]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..

[8]  Didier Colle,et al.  Pan-European Optical Transport Networks: An Availability-based Comparison , 2004, Photonic Network Communications.

[9]  Yaohui Jin,et al.  Optimized Designs of p-Cycles for Survivable Multicast Sessions in Optical WDM Networks , 2007, 2007 Second International Conference on Communications and Networking in China.

[10]  Sheng Wang,et al.  On protecting dynamic multicast sessions in survivable mesh WDM networks , 2006, 2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference.

[11]  Feng Zhang,et al.  Performance Evaluation of Optical Multicast Protection Approaches for Combined Node and Link Failure Recovery , 2009, Journal of Lightwave Technology.

[12]  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.

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

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

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

[16]  M.J. O'Mahony,et al.  Results from the COST 239 project. Ultra-High Capacity Optical Transmission Networks , 1996, Proceedings of European Conference on Optical Communication.

[17]  Biswanath Mukherjee,et al.  A heuristic method for design of survivable WDM networks with p-cycles , 2004, IEEE Communications Letters.

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

[19]  M.Y. Saidi,et al.  Improved dual-forest for multicast protection , 2006, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06..