Abstract

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Keywords

Chord (peer-to-peer)Computer scienceScalabilityPastryKey (lock)Distributed hash tableTheoretical computer scienceDistributed computingNode (physics)Computer networkPeer-to-peerEngineeringDatabaseOperating system

Affiliated Institutions

Related Publications

Wireless sensor networks

Gregory J. Pottie

Advances in commercial IC fabrication technology have made possible the integration of wireless transceivers, CMOS signal processing, and sensing in one integrated circuit packa...

2002 232 citations

Publication Info

Year
2001
Type
article
Pages
149-160
Citations
9645
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

9645
OpenAlex

Cite This

Ion Stoica, Robert Morris, David R. Karger et al. (2001). Chord. , 149-160. https://doi.org/10.1145/383059.383071

Identifiers

DOI
10.1145/383059.383071