Search Party Reliable Multicast

Adam M. Costello, advisor Steven McCanne
Computer Science Division
University of California at Berkeley

Search Party is an approach to multicast loss recovery that uses the multicast distribution tree to localize retransmissions. It is heavily inspired by the LMS approach [published] [expanded] of Christos Papadopoulos et al, but uses a randomized forwarding service called randomcast to prevent malfunctioning receivers from adversely affecting large numbers of other receivers. The price is a constant-factor increase in retransmission delay and protocol overhead, but the tradeoff between the two is tunable.

Search Party is described in:

[AMC]  Prepared by Adam M. Costello
 Last modified: 1999-Nov-08-Mon 02:22:02 GMT
[Any Browser]