Scalable feedback for large groups
IEEE/ACM Transactions on Networking (TON)
Selecting the QoS Parameters for Multicast Applications Based on User Profile and Device Capability
IDMS '01 Proceedings of the 8th International Workshop on Interactive Distributed Multimedia Systems
IEEE/ACM Transactions on Networking (TON)
A Comparison of Multicast Feedback Control Mechanisms
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
On the scaling of feedback algorithms for very large multicast groups
Computer Communications
| Hi-index | 0.07 |
Reliable multicast protocols suffer from the problem of feedback implosion. To avoid this problem, the number of receivers sending feedback in case of loss must be small. However, losses experienced by different receivers are strongly correlated, since receivers share common resources in the multicast tree. One approach to feedback implosion avoidance relies on delaying feedback at the receivers. We present deterministic timeouts for reliable multicast (DTRM), a distributed algorithm to compute optimal deterministic timeouts for each receiver in a multicast tree as a function of the tree topology and the sender-to-receiver round-trip delays. DTRM has several desirable properties. First, feedback implosion is provably avoided for a single loss anywhere in the tree, provided delay jitter is bounded. Second, the computation of the timeouts can be entirely distributed; receivers and intermediate nodes only rely on local topology information. Third, the timeouts computed by DTRM are optimal with respect to the maximum response time