A comparison of reliable multicast protocols

Abstract. We analyze the maximum throughput that known classes of reliable multicast transport protocols can attain. A new taxonomy of reliable multicast transport protocols is introduced based on the premise that the mechanisms used to release data at the source after correct delivery should be decoupled from the mechanisms used to pace the transmission of data and to effect error recovery. Receiver-initiated protocols, which are based entirely on negative acknowledgments (naks) sent from the receivers to the sender, have been proposed to avoid the implosion of acknowledgements (acks) to the source. However, these protocols are shown to require infinite buffers in order to prevent deadlocks. Two other solutions to the ack-implosion problem are tree-based protocols and ring-based protocols. The first organize the receivers in a tree and send acks along the tree; the latter send acks to the sender along a ring of receivers. These two classes of protocols are shown to operate correctly with finite buffers. It is shown that tree-based protocols constitute the most scalable class of all reliable multicast protocols proposed to date.

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

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

[3]  Sridhar Pingali Protocol and real-time scheduling issues for multimedia applications , 1994 .

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Stephen Deering,et al.  Multicast routing in a datagram internetwork , 1992 .

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

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

[8]  R CheritonDavid,et al.  Log-based receiver-reliable multicast for distributed interactive simulation , 1995 .

[9]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

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

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

[12]  R CheritonDavid,et al.  Multicast routing in datagram internetworks and extended LANs , 1990 .

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

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

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

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

[17]  Alfred C. Weaver,et al.  Xtp: The Xpress Transfer Protocol , 1992 .

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

[19]  Lixia Zhang,et al.  NETBLT: a high throughput transport protocol , 1987, SIGCOMM '87.

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

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

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

[23]  Sanjoy Paul,et al.  Multicast transport protocols for high speed networks , 1994, Proceedings of ICNP - 1994 International Conference on Network Protocols.

[24]  Donald F. Towsley,et al.  A comparison of sender-initiated and receiver-initiated reliable multicast protocols , 1994, IEEE J. Sel. Areas Commun..