The case for reliable concurrent multicasting using shared ACK trees
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
A comparison of reliable multicast protocols
Multimedia Systems
Local error recovery in SRM: comparison of two approaches
IEEE/ACM Transactions on Networking (TON)
Performance comparison of centralized versus distributed error recovery for reliable multicast
IEEE/ACM Transactions on Networking (TON)
Buffer requirements and replacement policies for multicast repair service
COMM '00 Proceedings of NGC 2000 on Networked group communication
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
An integrated platform for reliable multicast support in the regional mobile-IP environment
ACM SIGMOBILE Mobile Computing and Communications Review
MTCP: scalable TCP-like congestion control for reliable multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Router Assisting Control Tree Configuration Mechanism for Reliable Multicast
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
Impact of Tree Structure on Retransmission Efficiency for TRACK
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
A new configuration scheme for ACK tree in reliable multicast protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
Introducing reliability in content-based publish-subscribe through epidemic algorithms
Proceedings of the 2nd international workshop on Distributed event-based systems
A Framework to Support Survivable Web Services
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
Securing the Frisbee multicast disk loader
CSET'08 Proceedings of the conference on Cyber security experimentation and test
A cluster-tree protocol for reliable multicasting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path-diversity P2P overlay retransmissioll for reliable IP-multicast
IEEE Transactions on Multimedia
Measuring the performance of OrbixTalk: a reliable multicast messaging system
Computer Communications
Improving scalability on reliable multicast communications
Computer Communications
| Hi-index | 0.00 |
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast 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 acknowledgments (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. Following our taxonomy, the maximum attainable throughput by the known classes of reliable multicast protocols is analyzed. It is shown that tree-based protocols constitute the most scalable class of all reliable multicast protocols proposed to date.