|
In trying to satisfy a large and diverse group of receivers, a
multicast flow may end up operating at an unsatisfactorily low
transmission rate. This paper discusses when to prune (discard)
slow receivers from the multicast group, and how to choose them.
We examine this problem from a conceptual point of view, as well
as explore the space of practical algorithms. In particular, we
describe a class of decentralized and distributed algorithms and
their implementation. How well they carry out pruning is shown
through extensive measurements of a test network. We discovered
the primary trade-off is between timely pruning and accurate
pruning and describe how this can be controlled in our algorithms.
Our results are applicable to both repair-tree as well as
router-assisted multicast settings.
|
