ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

  • Lu, Cai (Key Lab of Broadband Optical Fiber Transmission and Communication Network, University of Electronic Science and Technology) ;
  • Luo, Hongbin (Key Lab of Broadband Optical Fiber Transmission and Communication Network, University of Electronic Science and Technology) ;
  • Wang, Sheng (Key Lab of Broadband Optical Fiber Transmission and Communication Network, University of Electronic Science and Technology) ;
  • Li, Lemin (Key Lab of Broadband Optical Fiber Transmission and Communication Network, University of Electronic Science and Technology)
  • Received : 2005.08.22
  • Published : 2006.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

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

Keywords