Core-Selection Algorithms in Multicast Routing

The Core-based approach is inevitable in multicast routing protocols as it provides efficient management of multicast path in changing group memberships, and scalability and performance. In this paper, we present a comprehensive analysis of this approach with the emphasis on core selection for the first time in literature. We first examine the evolution of multicast routing protocols into the core-based architecture and the motivation for the approach. Then we review the core-selection algorithms in the literature for their algorithmic structure and performance. Our study involves an extensive computational and message complexity analysis of each algorithm, and a classification for their deployment characteristics and algorithmic complexities. To the best of our knowledge ours is the first paper providing such extensive comparative analysis of core-based multicast routing protocols.

[1]  Shridhar B. Shukla,et al.  Multicast tree construction in network topologies with asymmetric link loads , 1994 .

[2]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[3]  Clay Shields.  Ordered Core Based Trees , 1996 .

[4]  Tony Ballardie,et al.  Core Based Trees (CBT version 2) Multicast Routing - Protocol Specification - , 1997, RFC.

[5]  Douglas S. Reeves,et al.  Multicast routing for real-time communication of high-speed networks , 1996 .

[6]  Hossam S. Hassanein,et al.  DCMC - delay-constrained multipoint communication with multiple sources , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[7]  David Thaler,et al.  A dynamic bootstrap mechanism for rendezvous-based multicast routing , 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).

[8]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

[9]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[10]  Ellen W. Zegura,et al.  Core selection methods for multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[11]  J. J. Garcia-Luna-Aceves,et al.  The ordered core based tree protocol , 1997, Proceedings of INFOCOM '97.

[12]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[13]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

[14]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

[15]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[16]  D. W. Wall.  Mechanisms for broadcast and selective broadcast , 1980 .