Protecting a multicast session against single link failures in a mesh network

In this report, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. We propose two new and efficient approaches for protecting a multicast session: 1) segment protection in which we protect each segment in the primary tree separately (rather than the entire tree) and allow these backup segments to share arcs with the other existing primary and backup segments; and 2) path-pair protection in which we protect a path between each source-destination pair by finding a disjoint backup path. Unlike previous schemes such as finding link-disjoint trees and arc-disjoint trees, our new schemes 1) guarantee a solution where previous schemes fail and 2) find efficient solution requiring less network resources. Our algorithm, based on the path-pair protection scheme, called optimal path-pair-based shared disjoint paths (OPP-SDP) algorithm, finds a solution if such a solution exists and outperforms all the other schemes in terms of network cost. We also show that OPP-SDP performs close to the optimal solution obtained by solving a mathematical formulation of the problem expressed as an integer linear program (ILP).

[1]  Sanjoy Paul,et al.  Multicasting on the Internet and its Applications , 1998, Springer US.

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

[3]  Chunming Qiao,et al.  Benefits of multicasting in all-optical networks , 1998, Other Conferences.

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

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

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

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[8]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[9]  C. Kenneth Miller,et al.  Multicast Networking and Applications , 1998 .

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[12]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .