Chord: a scalable peer-to-peer lookup protocol for internet applications

  title={Chord: a scalable peer-to-peer lookup protocol for internet applications},
  author={I. Stoica and R. Morris and D. Liben-Nowell and D. Karger and M. Kaashoek and F. Dabek and H. Balakrishnan},
  journal={IEEE/ACM Trans. Netw.},
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired 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 pair at the node to which the key maps. Chord adapts efficiently as… Expand
An Improved Lookup Algorithm for Chord
Hierarchical Bidirectional Chord
  • Minghui Ji
  • Computer Science
  • 2010 International Conference on Educational and Information Technology
  • 2010
DiST: A Scalable, Efficient P2P Lookup Protocol
BiChord: An Improved Approach for Lookup Routing in Chord
Using bidirectional links to improve peer-to-peer lookup performance
Improving the lookup performance of peer-to-peer storage via proxy-based hierarchy chord
An Improvement to the Chord-Based P2P Routing Algorithm
Enhancing peer-to-peer systems through redundancy