Chord: A scalable peer-to-peer lookup service for internet applications

By Ion Stoica, Robert Morris, David R Karger, M. Frans Kaashoek, Hari Balakrishnan. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2001

11,922 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f03db79dc2922af3ec712592c8a3f69182ec5d65

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

1. Ion Stoica
2. Scott Shenker
3. Anne-Marie Kermarrec
4. John Risson
5. Tim Moors
6. Peter Druschel
7. Hector Garcia-Molina
8. Antony Ian Taylor Rowstron

Citations in the corpus

• PeopleNet: engineering a wireless virtual social network (2005, background): “Another related idea is that of peer-to-peer (P2P) networks in the wired/wireless world [11, 12, 13, 14].”
• Peer-to-peer architecture case study: Gnutella network (2001, background): “Recent research projects: Chord [19], CAN [21], SDS [23] or OceanStore [22] focus on building Intenet scale overlay networks and offer a vast array of choices future Gnutella implementations could build on.”
• Declarative networking: language, execution and optimization (2006, methodology): “In proposals for declarative networks [23, 24], Datalog-like programs were used for a variety of networking tasks, including standard routing protocols such as distance vector [25] and dynamic source routing [20], and more complex networks such as multicast trees and the Chord network [34].”
• PocketLens: Toward a personal recommender system (2004, methodology): “Our next architecture is based on recent advances in architectures for peer-topeer file sharing networks such as Chord, CAN, and Pastry [Stoica et al. 2001; Ratnasamy et al. 2001; Rowstron and Druschel 2001a; Druschel and Rowstron 2001].”
• Serverless Computing: Design, Implementation, and Performance (2017, background): “This is perhaps the largest issue with our current implementation; however, other warm stack storage options such as a Redis cache [30] or a consistent hashing [31] implementation are promising, and may offer improved performance as well.”
• The ganglia distributed monitoring system: design, implementation, and experience (2004, background): “One promising direction here might be to leverage distributed hash tables such as CAN [25], Chord [28], Pastry [26], and Tapestry [31].”
• Application-Level Multicast Using Content-Addressable Networks (2001, methodology): “Several recent research papers [13, 15, 12] propose systems similar to CANs in that they construct application-level networks where nodes are structured in a well-defined manner.”
• BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005, methodology): “CHORD [7], CAN [13], Pastry [14], and Tapestry [16] are four of the best-known P2P systems.”
• Giggle: A Framework for Constructing Scalable Replica Location Services (2002, background): “The most relevant to our current work are resource discovery systems in which resources are uniquely identified by an attribute (usually a globally unique name): CAN [35], Chord [36], Tapestry [37], Gnutella [38], Freenet [39], and Napster.”
• A peer-to-peer anonymizing network layer (2002, neutral): “This local operation differs from peer-to-peer distributed hash tables [24].”
• The rainbow skip graph: a fault-tolerant constant-degree distributed data structure (2006, background): “For example, there is a considerable amount of work on variants of Distributed Hash Ta­bles (DHTs), including Chord [9, 19], Koorde [12], Pas­try [17], Scribe [18], Symphony [13], and Tapestry [21], to name just a few.”
• Towards a Common API for Structured Peer-to-Peer Overlays (2003, methodology): “While the chosen example systems (CAN, Chord, Pastry, Tapestry) do not constitute an exhaustive list of structured overlays, they represent a cross-section of existing systems and support our claim the the API can be widely implemented easily.”
• Meghdoot: Content-Based Publish/Subscribe over P2P Networks (2004, methodology): “CAN [18], Chord [23], Pastry [20], and Tapestry [30] are different examples of DHT's.”
• PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities (2004, background): “They can be implemented either on top of a P2P network [32], [1], [34] or using a conventional client-server platform.”