SRM (Scalable Reliable Multicast) abstracts
Optimal Deterministic Timeouts for Reliable Scalable Multicast,
Infocom 1996, pp. 1425-1432.
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 receivers are
strongly correlated due to the resource sharing in the multicast tree.
We present DTRM (Deterministic Timeouts for Reliable Multicast), a
distributed algorithm to compute 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 routers only rely on 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 routers, and receivers do not have to
We forsee 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 round-trip
- Kasera, S., Kurose, J., and Towsley, D.,
Scalable Reliable Multicast Using Multiple Multicast
CMPSCI Technical Report TR 96-73, October 1996.
Last modified: October 1996