Asymptotic scaling behavior of global recovery in SRM
Raman, S.
McCanne, S.
Shenker, S.
Abstract
| The development and deployment of a large-scale, wide-area multicast
infrastructure in the Internet has enabled a new family of multi-party,
collaborative applications. Several of these applications, such as
multimedia slide shows, shared whiteboards, and large-scale
multi-player games, require reliable multicast transport, yet the
underlying multicast infrastructure provides only a best-effort
delivery service. A difficult challenge in the design of efficient
protocols that provide reliable service on top of the best-effort
multicast service is to maintain acceptable performance as the
protocol scales to very large session sizes distributed across the
wide area. The Scalable, Reliable Multicast (SRM) protocol [6] is
a receiver-driven scheme based on negative acknowledgments (NACKs)
reliable multicast protocol that uses randomized timers to limit
the amount of protocol overhead in the face of large multicast
groups, but the behavior of SRM at extremely large scales is not
well-understood.
|
Keywords
algorithmic
routing
tree
SRM
Notes
Related Papers
Bibtex
@inproceedings{raman.mccanne_srm98,
author ="S. Raman and S. McCanne and S. Shenker",
title ="Asymptotic scaling behavior of global recovery in {SRM}",
pages ="",
volume ="",
booktitle ="Proceedings of SIGMETRICS/PERFORMANCE 98, Joint International Conference on Measurement and Modeling of Computer Systems",
year ="1998",
documentURL =""
}