Application-Level Multicast Using Content-Addressable Networks Export

@inproceedings{citeulike:1668913, abstract = {Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a Distance-Vector 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.}, address = {London, UK}, author = {Ratnasamy, Sylvia and Handley, Mark and Karp, Richard M. and Shenker, Scott}, booktitle = {NGC '01: Proceedings of the Third International COST264 Workshop on Networked Group Communication}, citeulike-article-id = {1668913}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=648089.747491}, citeulike-linkout-1 = {http://www.cs.huji.ac.il/labs/danss/p2p/resources/application-level-multicast-using-can.pdf}, isbn = {3540428240}, keywords = {can, lecture-pap, multicast}, pages = {14--29}, posted-at = {2008-10-22 14:30:39}, priority = {0}, publisher = {Springer-Verlag}, title = {Application-Level Multicast Using Content-Addressable Networks}, url = {http://portal.acm.org/citation.cfm?id=648089.747491}, year = {2001} }

TY - CONF ID - citeulike:1668913 L3 - citeulike-article-id:1668913 N2 - Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a Distance-Vector 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. SN - 3540428240 AD - London, UK EP - 29 TI - Application-Level Multicast Using Content-Addressable Networks PB - Springer-Verlag T2 - NGC '01: Proceedings of the Third International COST264 Workshop on Networked Group Communication SP - 14 KW - can KW - lecture-pap KW - multicast AU - Ratnasamy, Sylvia AU - Handley, Mark AU - Karp, Richard AU - Shenker, Scott PY - 2001/// UR - http://portal.acm.org/citation.cfm?id=648089.747491 ER -