ACM Home Page
Please provide us with feedback. Feedback
Chord: A scalable peer-to-peer lookup service for internet applications
Full text PdfPdf (206 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
San Diego, California, United States
Pages: 149 - 160  
Year of Publication: 2001
ISBN:1-58113-411-8
Also published in ...
Authors
Ion Stoica  University of California, Berkeley
Robert Morris  MIT Laboratory for Computer Science
David Karger  MIT Laboratory for Computer Science
M. Frans Kaashoek  MIT Laboratory for Computer Science
Hari Balakrishnan  MIT Laboratory for Computer Science
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 195,   Downloads (12 Months): 1194,   Citation Count: 950
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/383059.383071
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ANDERSEN, D. Resilient overlay networks. Master's thesis, Department of EECS, MIT, May 2001. http://nms.lcs.mit.edu/projects/ron/.
 
2
BAKKER, A., AMADE, E., BALLINTIJN, G., KUZ, I., VERKAIK, P. , VAN DER WIJK, I., VAN STEEN, M., AND TANENBAUM., A. The Globe distribution network. In Proc. 2000 USENIX Annual Conf. (FREENIX Track) (San Diego, CA, June 2000), pp. 141-152.
3
 
4
CLARKE, I. A distributed decentralised information storage and retrieval system. Master's thesis, University of Edinburgh, 1999.
 
5
CLARKE, I., SANDBERG, O., WILEY, B., AND HONG,T.W. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability (Berkeley, California, June 2000). http://freenet.sourceforge.net.
 
6
7
 
8
DRUSCHEL,P.,AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65-70.
 
9
FIPS 180-1. Secure Hash Standard. U.S. Department of Commerce/NIST, National Technical Information Service, Springfield, VA, Apr. 1995.
 
10
Gnutella. http://gnutella.wego.com/.
11
12
 
13
LEWIN, D. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis.mit.edu/.
14
15
 
16
 
17
Napster. http://www.napster.com/.
 
18
Ohaha, Smart decentralized peer-to-peer sharing. http://www.ohaha.com/design.html.
19
20
 
21
STOICA, I., MORRIS, R., KARGER, D., KAASHOEK,M.F.,AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. Tech. Rep. TR-819, MIT LCS, March 2001. http://www.pdos.lcs.mit.edu/chord/papers/.
 
22
VAN STEEN, M., HAUCK,F.,BALLINTIJN, G., AND TANENBAUM, A. Algorithmic design of the Globe wide-area location service. The Computer Journal 41, 5 (1998), 297-310.

CITED BY  952