28 September 2006 Optimal multicast protection with differentiated leaf availability guarantee in optical mesh networks
Author Affiliations +
Proceedings Volume 6354, Network Architectures, Management, and Applications IV; 63541I (2006) https://doi.org/10.1117/12.688270
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
Abstract
Because any link failure on the multicast session may disrupt the signal transmission to several downstream nodes, it is imperative to effectively protect the multicast sessions against link failure. In this paper, we study schemes for establishing primary and backup multicast trees for multicast sessions in a optical mesh network against link failure, e.g., fiber or conduit cut, with taking the different leaf availability requirement and availability guarantee into account. We propose an Mixed Integer Linear Program (MILP) approach to solve the problem of provisioning survivable multicast sessions with differentiated leaf availability guaranteed. Different from the previous schemes, our scheme finds out the complete (the tree spans the root and all the leaf nodes) primary and complete or incomplete (the tree spans the root and part of the leaf nodes) backup trees for multicast sessions guarantees the availability requirement. Because of taking the different leaf availability requirements into ccount, the proposed algorithm finds out more efficient feasible solution requiring less network resources, and even find a feasible solution where the previous algorithms fail.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Guowu Xie, Weiqiang Sun, Yaohui Jin, Wei Guo, Weisheng Hu, "Optimal multicast protection with differentiated leaf availability guarantee in optical mesh networks", Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63541I (28 September 2006); doi: 10.1117/12.688270; https://doi.org/10.1117/12.688270
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT


Back to Top