DMCA
Application-Level Multicast Using Content-Addressable Networks (2001)
Cached
Download Links
| Citations: | 372 - 8 self |
BibTeX
@INPROCEEDINGS{Ratnasamy01application-levelmulticast,
author = {Sylvia Ratnasamy and Mark Handley and Richard Karp and Scott Shenker},
title = {Application-Level Multicast Using Content-Addressable Networks},
booktitle = {},
year = {2001},
pages = {14--29}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, or a similar algorithm, is used to construct source-rooted distribution trees. The use of a global routing protocol limits the scalability of these systems. Other proposed solutions that scale to larger numbers of receivers do so by restricting the multicast service model to be single-sourced. In this paper, we propose an application-level multicast scheme capable of scaling to large group sizes without restricting the service model to a single source. Our scheme builds on recent work on Content-Addressable Networks (CANs). Extending the CAN framework to support multicast comes at trivial additional cost and, because of the structured nature of CAN topologies, obviates the need for a multicast routing algorithm. Given the deployment of a distributed infrastructure such as a CAN, we believe our CAN-based multicast scheme offers the dual advantages of simplicity and scalability.
Keyphrases
application-level multicast using content-addressable network multicast routing algorithm can-based multicast scheme service model distancevector routing protocol large group content-addressable network distributed infrastructure recent work global routing protocol trivial additional cost scheme build multicast service model application-level multicast scheme application-level multicast source-rooted distribution tree group member application-level mesh single source similar algorithm dual advantage structured nature
