A cluster-tree protocol for reliable multicasting

Distributed simulations and conferences require a reliable multicast protocol that guarantees safe data delivery in a reasonably short time. Such high-quality service demands substantial network resources. As these applications grow in use, scalability becomes an important issue. One way to achieve scalability is through clustering. The overall load is distributed among clusters so that large multicast groups avoid overloading the network. We propose a protocol for reliable multicasting, based on a cluster structure. We prove that in the cluster, the leader is an ancestor of all cluster members with respect to the multicast routing tree. This relationship yields an efficient acknowledgement structure. We also describe an acknowledgement algorithm based on a pulsing mechanism and prove that it has constant latency for acknowledging data. Finally, we show that the protocol is scalable by proving that it generates a constant load for all nodes.

[1]  Madhu Sudan,et al.  A reliable dissemination protocol for interactive collaborative applications , 1995, MULTIMEDIA '95.

[2]  Sanjoy Paul,et al.  RMTP: a reliable multicast transport protocol , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  André Schiper,et al.  Theory and Practice in Distributed Systems , 1995, Lecture Notes in Computer Science.

[4]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.

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

[6]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[7]  Sandeep K. Singhal,et al.  Log-based receiver-reliable multicast for distributed interactive simulation , 1995, SIGCOMM '95.

[8]  Donald F. Towsley,et al.  A Comparison of Sender-Initiated and Receiver-Initiated Reliable Multicast Protocols , 1997, IEEE J. Sel. Areas Commun..

[9]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[10]  J. J. Garcia-Luna-Aceves,et al.  The case for reliable concurrent multicasting using shared ACK trees , 1997, MULTIMEDIA '96.

[11]  Esther Jennings,et al.  Evaluating graph theoretic clustering algorithms for reliable multicasting , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

[14]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[15]  J. William Atwood,et al.  Reliable multicasting in the Xpress transport protocol , 1996, Proceedings of LCN - 21st Annual Conference on Local Computer Networks.

[16]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[17]  J. J. Garcia-Luna-Aceves,et al.  A comparison of known classes of reliable multicast protocols , 1996, Proceedings of 1996 International Conference on Network Protocols (ICNP-96).

[18]  Todd Montgomery,et al.  A High Performance Totally Ordered Multicast Protocol , 1994, Dagstuhl Seminar on Distributed Systems.

[19]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.