XTP: the Xpress Transfer Protocol
XTP: the Xpress Transfer Protocol
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A comparison of sender-initiated and receiver-initiated reliable multicast protocols
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Log-based receiver-reliable multicast for distributed interactive simulation
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The case for reliable concurrent multicasting using shared ACK trees
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
MTCP: scalable TCP-like congestion control for reliable multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multicast Feedback Suppression Using Representatives
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Caching policy design and cache allocation in active reliable multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computing with data non-determinism: Wait time management for peer-to-peer systems
Computer Communications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Cascading multi-way bounded wait timer management for moody and autonomous systems
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Hi-index | 0.00 |
Reliable multicast suffers from the problem of feedback implosion. To achieve scalability, the number of receivers sending feedback in case of loss must remain small. However, losses experienced by different receivers are strongly correlated, since they share resources in the multicast tree. We present DTRM (Deterministic Timeouts for Reliable Multicast), a distributed algorithm to compute optimal deterministic timeouts for each receiver in a multicast tree as a function of the tree topology and sender-to-receiver delays. DTRM has several desirable properties. First, the computation of the timeouts is entirely distributed; receivers and intermediate nodes only rely pn local topology information. Second, NACK implosion is provably avoided for a single loss anywhere in the tree if delay jitter is bounded. Third, feedback information does not need to be processed by intermediate nodes, and receivers do not have to collaborate. We foresee two possible uses for DTRM. In networks providing hard delay bounds, timeouts can be computed once at session set-up time. In networks with unbounded delays, such as the Internet, timeouts can be adaptively recomputed in response to changes in estimated roundtrip times.