Intra- and inter-domain multicast routing protocols: A survey and taxonomy

A multicast routing protocol should be scalable, robust, use minimal network overhead, consume minimal memory resources, inter-operate with other multicast routing protocols, and be easy to implement. The mechanism used to manage the multicast group (participants join and leave throughout the multicast session) is an important issue when designing a protocol for multicast routing. Other design choices are influenced by the distribution of the participants over the routing domain (sparse or dense), the role of the participants in the group (source, receiver, or both), the number of groups and participants per group, and the requirements of the participants in terms of transmission delay. In this study a taxonomy of IP multicast routing protocols for dynamic groups will be presented. This taxonomy will be used to classify a surveyed set of intra- and inter-domain multicast routing protocols and to discuss successful protocol design regarding satisfaction of the multicast application's latency requirements as well as the network's resource consumption requirements.

[1]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[2]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[3]  Steven McCanne,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995, SIGCOMM '95.

[4]  Wim Livens,et al.  IP multicast shortcut over ATM: a winner combination , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[5]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[6]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[7]  Stephen E. Deering,et al.  Multicast routing in internetworks and extended LANs , 1988, CCRV.

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

[9]  J. J. Garcia-Luna-Aceves,et al.  The HIP protocol for hierarchical multicast routing , 1998, PODC '98.

[10]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[11]  D. Estrin,et al.  The MASC/BGMP architecture for inter-domain multicast routing , 1998, SIGCOMM '98.

[12]  Sanjoy Paul,et al.  Centralized multicast , 1999, Proceedings. Seventh International Conference on Network Protocols.

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

[14]  Jon Crowcroft,et al.  Multicast-specific security threats and counter-measures , 1995, Proceedings of the Symposium on Network and Distributed System Security.

[15]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[16]  J. J. Garcia-Luna-Aceves,et al.  Improving Internet multicast with routing labels , 1997, Proceedings 1997 International Conference on Network Protocols.

[17]  Alexandros Eleftheriadis,et al.  Distributed Multicast Address Management in the Global Internet , 1995, IEEE J. Sel. Areas Commun..

[18]  Horst Hodel,et al.  Policy tree multicast routing: an extension to sparse mode source tree delivery , 1998, CCRV.

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

[20]  J. J. Garcia-Luna-Aceves,et al.  A Protocol for Scalable Loop-Free Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[21]  J. J. Garcia-Luna-Aceves,et al.  Scalable Internet multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[22]  Jon Crowcroft,et al.  Building shared trees using a one-to-many joining mechanism , 1997, CCRV.

[23]  Stephen E. Deering,et al.  Hierarchical distance-vector multicast routing for the MBone , 1995, SIGCOMM '95.

[24]  J. J. Garcia-Luna-Aceves,et al.  KHIP—a scalable protocol for secure multicast routing , 1999, SIGCOMM '99.

[25]  M. Faloutsos,et al.  QoSMIC: quality of service sensitive multicast Internet protocol , 1998, SIGCOMM '98.

[26]  J. Bibb Cain,et al.  Performance and Resource Cost Comparisons for the CBT and PIM Multicast Routing Protocols , 1997, IEEE J. Sel. Areas Commun..

[27]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.