Application-Level Multicast Using Content-Addressable Networks

By Sylvia Ratnasamy, Mark James Handley, Richard M. Karp, Scott Shenker. Networked Group Communication, 2001

732 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/98d3af67da80c2e77da7331377a14612600eb70e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Dissecting BitTorrent: Five Months in a Torrent's Lifetime (2004, background): “On the client side, one finds many proposals to build application-layer multicast services [8, 6, 3].”
OpenDHT: a public DHT service and its uses (2005, unknown): “As described in Section 4, existing DHT-based multicast systems [7, 27, 35] typically use a routing interface.”
A scalable content-addressable network (2001, background): “There are many other directions in which CAN can be used: application layer multicast [5], event notification services [4], chat services [3] and others.”
The impact of DHT routing geometry on resilience and proximity (2003, unknown): “Overlay multicast: When setting up a multicast tree [1, 20, 29], one cares about both the lengths of each individual path (considered in the previous section) and the overall efficiency of the entire multicast tree.”
The many faces of publish/subscribe (2003, methodology): “To ensure high throughput, IP multicast or a wide range of reliable multicast protocols [32, 42, 49, 18, 8, 57, 74] are commonly employed.”
Meghdoot: Content-Based Publish/Subscribe over P2P Networks (2004, methodology): “CAN-based multicast [19] is an application level multicast system based on CAN.”
Symphony: Distributed Hashing in a Small World (2003, background): “The research community is working on a wide variety of peer to peer applications like persistent data storage (CFS 6], Farsite 3], Oceanstore 11], PAST 19]), event notiication and application level multicast (Bayeux 23], Scribe 20] and CAN-based Multicast 17]), DNS 5], resource discovery 2] and coop”
Survey of research towards robust peer-to-peer networks: Search methods (2006, methodology): “CAN-based multicast was the first application-level multicast scheme to scale to groups of several thousands of nodes without restricting the service model to a single source [320].”
Peer-to-Peer Membership Management for Gossip-Based Protocols (2003, background): “the routing functionality of the peer-to-peer overlay either to build a multicast tree in a decentralized fashion (Scribe [6] and Bayeux [27]) or to build a mini-overlay [23] in which”
Routing Algorithms for DHTs: Some Open Questions (2002, methodology): “Routing Algorithms for DHTs: Some Open Questions Sylvia Ratnasamy (sylviar@cs.berkeley.edu) Scott Shenker (shenker@icsi.berkeley.edu) Ion Stoica (istoica@cs.berkeley.edu)”
Tapestry: a resilient global-scale overlay for service deployment (2004, unknown): “Several systems have application level multicast: CAN-MC [21] (CAN), Scribe [22] (Pastry), and Bayeux [5] (Tapestry).”
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination (2001, background): “The CAN multicast work by Ratnasamy et al. [ 23 ] and the SCRIBE work by Rowstron et al. [27] are similar to Bayeux in that they achieve scalability by leveraging the scalable routing infrastructure provided by systems like CAN [22], Pastry [26], and Tapestry respectively.”
An evaluation of scalable application-level multicast built using peer-to-peer overlays (2003, methodology): “1) CAN Flooding: The broadcast algorithm we implemented for CAN is based on the flooding algorithm described in [4], with some significant modifications.”