article

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

Authors:

David Liben-Nowell,

David R. Karger,

M. Frans Kaashoek,

Hari BalakrishnanAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 11, Issue 1

Pages 17 - 32

https://doi.org/10.1109/TNET.2002.808407

Published: 01 February 2003 Publication History

Abstract

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 nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.

References

[1]

S. Ajmani, D. Clarke, C.-H. Moh, and S. Richman, "ConChord: Cooperative SDSI certificate storage and name resolution," in Proc. 1st Int. Workshop Peer-to-Peer Systems, Cambridge, MA, Mar. 2002.

[2]

A. Bakker, E. Amade, G. Ballintijn, I. Kuz, P. Verkaik, W. I. van der, M. van Steen, and A. Tanenbaum, "The globe distribution network," in Proc. 2000 USENIX Annu. Conf. (FREENIX Track), San Diego, CA, June 2000, pp. 141--152.

[3]

J.L. Carter and M. N. Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143--154, 1979.

[4]

Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos, "A prototype implementation of archival intermemory," in Proc. 4th ACM Conf. Digital Libraries, Berkeley, CA, Aug. 1999, pp. 28--37.

[5]

I. Clarke, "A distributed decentralised information storage and retrieval system," Master's thesis, Univ. Edinburgh, Edinburgh, U.K., 1999.

[6]

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, "Freenet: A distributed anonymous information storage and retrieval system," in Proc. ICSI Workshop Design Issues in Anonymity and Unobservability, Berkeley, CA, June 2000, {Online}. Available: http://freenet.sourceforge.net.

[7]

R. Cox, A. Muthitacharoen, and R. Morris, "Serving DNS using Chord," in Proc. 1st Int. Workshop Peer-to-Peer Systems, Cambridge, MA, Mar. 2002.

[8]

F. Dabek, "A cooperative file system," Master's thesis, Massachusetts Inst. Technol., Cambridge, 2001.

[9]

F. Dabek, F. Kaashoek, D. R. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," in Proc. ACM Symp. Operating Systems Principles, Banff, Canada, 2001, pp. 202--215.

[10]

"Secure Hash Standard," U.S. Dept. Commerce/NIST, National Technical Information Service, Springfield, VA, FIPS 180--1, Apr. 1995.

[11]

Gnutella. {Online}. Available: http://gnutella.wego.com/

[12]

D. R. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web," in Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 654--663.

[13]

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, "Oceanstore: An architecture for global-scale persistent storage," in Proc. 9th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Boston, MA, Nov. 2000, pp. 190--201.

[14]

D. Lewin, "Consistent hashing and random trees: Algorithms for caching in distributed networks," Master's thesis, Department of Electric. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, 1998.

[15]

J. Li, J. Jannotti, D. De Couto, D. R. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proc. 6th ACM Int. Conf. Mobile Computing and Networking, Boston, MA, Aug. 2000, pp. 120--130.

[16]

D. Liben-Nowell, H. Balakrishnan, and D. R. Karger, "Analysis of the evolution of peer-to-peer systems," in Proc. 21st ACM Symp. Principles of Distributed Computing (PODC), Monterey, CA, July 2002, pp. 233--242.

[17]

R. Motwani and P. Raghavan, Randomized Algorithms. New York: Cambridge Univ. Press, 1995.

[18]

Napster. {Online}. Available: http://www.napster.com/

[19]

T. S. E. Ng and H. Zhang, "Toward global network positioning," presented at the ACM SIGCOMM Internet Measurements Workshop 2001, San Francisco, CA, Nov. 2001.

[20]

Ohaha: Smart decentralized peer-to-peer sharing. {Online}. Available: http://www.ohaha.com/design.html

[21]

C. Plaxton, R. Rajaraman, and A. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. ACM Symp. Parallelism in Algorithms and Architectures, Newport, RI, June 1997, pp. 311--320.

[22]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM S1GCOMM, San Diego, CA, Aug. 2001, pp. 161--172.

[23]

A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), Nov. 2001, pp. 329--350.

[24]

I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. C. Balakrishnan, "A scalable peer-to-peer lookup service for internet applications," Lab. Comput. Sci., Massachusetts Inst. Technol., Tech. Rep. TR-819, 2001.

[25]

M. van Steen, F. Hauck, G. Ballintijn, and A. Tanenbaum, "Algorithmic design of the globe wide-area location service," Comput. J., vol. 41, no. 5, pp. 297--310, 1998.

[26]

B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Comput. Sci. Div., Univ. California, Berkeley, Tech. Rep. UCB/CSD-01-1141, 2001.

Cited By

Ma RHwang KLi MMiao Y(2024)Trusted Model Aggregation With Zero-Knowledge Proofs in Federated LearningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.345576235:11(2284-2296)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3455762
Tian WJian GXu ZLi RXiao W(2024)PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy EliminationIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.336145021:5(4815-4826)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3361450
Dong CWang FFeng D(2023)DxHash: A Memory-saving Consistent Hashing AlgorithmACM Transactions on Internet Technology10.1145/363170824:1(1-22)Online publication date: 3-Nov-2023
https://dl.acm.org/doi/10.1145/3631708
Show More Cited By

Index Terms

Chord: a scalable peer-to-peer lookup protocol for internet applications
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Networks
  1. Network architectures
  2. Network protocols

Recommendations

Re-Chord: A Self-stabilizing Chord Overlay Network

The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems ...
Re-Chord: a self-stabilizing chord overlay network
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems ...
RDF-Chord

Peer-to-peer (P2P) computing has gained great attention in both research and industrial communities. Although many P2P systems, such as CAN, Pastry, Chord, and Tapstry have been proposed, they only support exact-match lookups. To overcome the limitation,...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 11, Issue 1

February 2003

175 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 February 2003

Published in TON Volume 11, Issue 1

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

593
Total Citations
View Citations
7,322
Total Downloads

Downloads (Last 12 months)155
Downloads (Last 6 weeks)86

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ma RHwang KLi MMiao Y(2024)Trusted Model Aggregation With Zero-Knowledge Proofs in Federated LearningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.345576235:11(2284-2296)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3455762
Tian WJian GXu ZLi RXiao W(2024)PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy EliminationIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.336145021:5(4815-4826)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3361450
Dong CWang FFeng D(2023)DxHash: A Memory-saving Consistent Hashing AlgorithmACM Transactions on Internet Technology10.1145/363170824:1(1-22)Online publication date: 3-Nov-2023
https://dl.acm.org/doi/10.1145/3631708
Lavoie E(2023)Designing Peer-to-Peer Systems as Closed Knowledge CommonsProceedings of the 4th International Workshop on Distributed Infrastructure for the Common Good10.1145/3631310.3633491(1-6)Online publication date: 11-Dec-2023
https://dl.acm.org/doi/10.1145/3631310.3633491
Dickinson CNagaraja SAhmed CHyde R(2023)AGRITRUST: A Testbed to Enable Trustworthy Smart AgriTechProceedings of the First International Symposium on Trustworthy Autonomous Systems10.1145/3597512.3600209(1-13)Online publication date: 11-Jul-2023
https://dl.acm.org/doi/10.1145/3597512.3600209
Laskowski PDetzner PBondorf SKemme BRiviere ESchiavoni VPasin M(2023)Tree-structured Overlays with Minimal Height: Construction, Maintenance and OperationProceedings of the 17th ACM International Conference on Distributed and Event-based Systems10.1145/3583678.3596894(168-176)Online publication date: 27-Jun-2023
https://dl.acm.org/doi/10.1145/3583678.3596894
Zerwas JGyörgyi CBlenk ASchmid SAvin C(2023)Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and ControlProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35794497:1(1-25)Online publication date: 2-Mar-2023
https://dl.acm.org/doi/10.1145/3579449
Wang ZZhao JAgrawal KLiu HXu MLi JDehnavi MKulkarni MKrishnamoorthy S(2023)Provably Good Randomized Strategies for Data Placement in Distributed Key-Value StoresProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577501(27-38)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577501
Zhang LHan WZhang RWang LMeng X(2023)Identity-Based Key Management Scheme for Secure Discussion Group Establishment in DOSNsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.328671218(3706-3719)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1109/TIFS.2023.3286712
Liri ERamakrishnan KKar K(2023)Energy-Efficient Distributed Task Scheduling for Multi-Sensor IoT NetworksIEEE Network: The Magazine of Global Internetworking10.1109/MNET.006.220054837:2(318-324)Online publication date: 6-Sep-2023
https://dl.acm.org/doi/10.1109/MNET.006.2200548
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents