Reliability and scaling issues in multicast communication

The efficiency with which multicast communication can take place is largely determined by the network level support available for such communication. Two factors contribute to the complexity of supporting current multicast applications: the lack of reliable multicast transport mechanisms at the network level and the lack of network support for large scale multicast communication. In this paper, we examine the issues pertinent to eliminating these shortcomings. We first show that internet multicasting algorithms based on reverse path forwarding are inherently unreliable and present a source-tree-based reliable multicasting scheme. The new scheme makes use of simple inter-gateway protocols and works on top of previously developed distance vector and link state internet routing schemes. Next, to support large scale applications, we present a scheme for partial multicasting and introduce a new network level operation, called gather. The partial multicasting mechanism allows messages to be delivered to subsets of multicast destinations, while the gather operation aids gateways in selectively suppressing redundant messages, thus reducing the message complexity. Using simulations, we investigate the efficacy of our schemes in supporting a sample application based on multicast communication.

[1]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[2]  Hector Garcia-Molina,et al.  Ordered and reliable multicast communication , 1991, TOCS.

[3]  Sudhir R. Ahuja,et al.  The rapport multimedia conferencing system , 1988, COCS '88.

[4]  Paul Wilson,et al.  Computer Supported Cooperative Work (CSCW): Origins, Concepts and Research Initiatives , 1991, Comput. Networks ISDN Syst..

[5]  Balasubramanian Rajagopalan Failsafe routing and multicasting in dynamic internets , 1992 .

[6]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM '89.

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

[8]  Baruch Awerbuch,et al.  "A reliable broadcast protocol" , 1982, 1982 21st IEEE Conference on Decision and Control.

[9]  Alfred Z. Spector,et al.  Distributed Transaction Processing and The Camelot System , 1987 .

[10]  Philip K. McKinley,et al.  A token-based protocol for reliable, ordered multicast communication , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.

[11]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[12]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[13]  Jon Crowcroft,et al.  A multicast transport protocol , 1988, SIGCOMM.

[14]  Mark Jones,et al.  Protocol design for large group multicasting: the message distribution protocol , 1991, Comput. Commun..

[15]  Kazuo Kera,et al.  An Autonomous, Decentralized Control System for Factory Automation , 1984, Computer.

[16]  David R. Cheriton,et al.  Amaze: A Multiplayer Computer Game , 1985, IEEE Software.

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

[18]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[19]  Alfred C. Weaver,et al.  Issues in Providing a Reliable Multicast Facility , 1989 .

[20]  Kenneth P. Birman,et al.  Supporting large scale applications on networks of workstations , 1989, Proceedings of the Second Workshop on Workstation Operating Systems.

[21]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[22]  Yogen K. Dalal,et al.  A Distributed Algorithm for Constructing Minimal Spanning Trees , 1987, IEEE Transactions on Software Engineering.