Adaptive segment protection algorithm of multicast on WDM networks against single link failure

This paper investigates the problem of protecting multicast sessions in mesh WDM (wavelength-division multiplexing) networks against single link failures, e.g., a fiber cut in optical networks. Firstly, we study the two characters of multicast sessions in mesh WDM networks with sparse light splitters configuration. Traditionally, a multicast tree does not contain any circles. The first character is that the multicast tree has better performances if it contains some circles. What is more, a multicast tree has several branches. If we add a path between the leaves nodes on different branches, the segment between them on multicast tree is protected. Based the two characters, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then a heuristic algorithm, named adaptive shared segment protection (ASSP) algorithm, is proposed for multicast session. ASSP algorithm does not identify the segment for multicast tree previously. The segments are determined during the process of algorithm according to the multicast tree and the sparse networks resource. Comparisons are made between ASSP and other two reported schemes link disjoint trees (LDT) and shared disjoint paths (SDP) in terms of blocking probability and resource cost on USNET topology. Simulations show that ASSP algorithm has better performances than other existing schemes.

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

[2]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[4]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

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

[6]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[7]  Biswanath Mukherjee,et al.  Sub-path protection for scalability and fast recovery in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

[8]  C. Siva Ram Murthy,et al.  Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks , 2002, SPIE ITCom.

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

[10]  Chunming Qiao,et al.  Constrained multicast routing in WDM networks with sparse light splitting , 2000 .

[11]  H. T. Mouftah,et al.  A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion , 2004, IEEE Journal on Selected Areas in Communications.

[12]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[13]  W.S. Hu,et al.  Multicasting optical cross connects employing splitter-and-delivery switch , 1998, IEEE Photonics Technology Letters.