On finding the best partial multicast protection tree under dual-homing architecture

In this paper, we introduce the concept of partial protection and propose an efficient solution for providing partial multicast protection given the dual-homing architecture in the access network. In the dual-homing architecture, each destination is connected to two edge routers to enhance the survivability in the access network. The routing algorithm which finds a path from the source to each edge router holds the key for the multicast protection. We study the problem of finding the best partial multicast protection tree for the multicast session given the dual-homing architecture assuming that the hop count on each path is limited. We show the NP-completeness of the problem and propose the partition and sharing (PAS) algorithm to solve the problem efficiently. Simulation results show that the PAS algorithm achieves performance very close to the computed lower bounds. The solution proposed in this paper fills the gap between traditional 100% protection and non-protection subject to single link failure.

[1]  Chunming Qiao,et al.  Novel algorithms for shared segment protection , 2003, IEEE J. Sel. Areas Commun..

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

[3]  M. C. Sinclair,et al.  Design and dimensioning of dual-homing hierarchical multi-ring networks , 2000 .

[4]  D. Castañón.  Efficient algorithms for finding the K best paths through a trellis , 1990 .

[5]  Seok Joo Koh,et al.  A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach , 1997, Comput. Oper. Res..

[6]  Mario Gerla,et al.  A "dual-tree" scheme for fault-tolerant multicast , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Shi-Wei Lee,et al.  A K-Best Paths Algorithm for Highly Reliable Communication Networks , 1999 .

[8]  Xiangtong Qi,et al.  Dual-homing multicast protection , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

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

[11]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[12]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.

[13]  Majid Sarrafzadeh,et al.  Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications , 1998, IEEE Trans. Computers.