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.
|
2394
|
Chord: A scalable peer-to-peer lookup service for Internet applications
– Stoica, Morris, et al.
- 2001
|
|
1950
|
A scalable Content-Addressable Network
– Ratnasamy, Francis, et al.
- 2001
|
|
1309
|
Randomized algorithms
– Motwani, Raghavan
- 1995
|
|
1284
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
812
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
702
|
Oceanstore: An architecture for global-scale persistent storage
– Kubiatowicz, Bindel, et al.
- 2000
|
|
674
|
Freenet: A distributed anonymous information storage and retrieval system
– Clarke, Sandberg, et al.
- 2000
|
|
612
|
Wide-area cooperative storage with CFS
– Dabek, Kaashoek, et al.
- 2001
|
|
468
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
428
|
A scalable location service for geographic ad-hoc routing
– LI, JANNOTTI, et al.
- 2000
|
|
386
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
339
|
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
– Karger, Lehman, et al.
- 1997
|
|
141
|
Analysis of the Evolution of the Peer-to-Peer Systems
– Liben-Nowell, Balakrishnan, et al.
- 2002
|
|
87
|
A prototype implementation of archival intermemory
– Chen, Edler, et al.
- 1999
|
|
35
|
Algorithmic design of the Globe wide-area location service
– Steen, Hauck, et al.
- 1998
|
|
32
|
A distributed decentralised information storage and retrieval system
– CLARKE
- 1999
|
|
30
|
The Globe distribution network
– Bakker, Amade, et al.
- 2000
|
|
30
|
Towards global network positioning
– NG, ZHANG
- 2001
|
|
24
|
Observations on the dynamic evolution of peer-to-peer networks
– LIBEN-NOWELL, BALAKRISHNAN, et al.
- 2002
|
|
22
|
Serving DNS using Chord
– Cox, Muthitacharoen, et al.
- 2002
|
|
16
|
Consistent hashing and random trees: Algorithms for caching in distributed networks
– LEWIN
- 1998
|
|
13
|
ConChord: Cooperative SDSI certificate storage and name resolution
– AJMANI, CLARKE, et al.
- 2002
|
|
8
|
A cooperative file system
– DABEK
- 2001
|
|
3
|
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World WideWeb
– Panigrahy
- 1997
|
|
3
|
decentralized peer-to-peer sharing. http://www. ohaha.com/design.html
– Ohaha
|
|
1
|
al.: CHORD: SCALABLE PEER-TO-PEER LOOKUP PROTOCOL 31 [3
– et
- 1979
|
|
1
|
A cooperative file system,” Master’s thesis, Massachusetts Inst
– Dabek
- 2001
|
|
1
|
National Technical Information Service
– CommerceNIST
- 1995
|
|
1
|
Computing and Networking
– Mobile
- 2000
|
|
1
|
Toward global network positioning,” presented at the
– Ng, Zhang
- 2001
|
|
1
|
received the Ph.D. degree from Carnegie Mellon University
– Stoica
- 2000
|
|
1
|
is the recipient of a National Science Foundation CAREER Award in 2002, and the Association for Computing Machinery (ACM) Doctoral Dissertation Award in 2001. He is a member of the ACM. Robert Morris received the Ph.D. degree from
– Stoica
|
|
1
|
received the B.A. degree from Cornell University
– Liben-Nowell
- 1999
|
|
1
|
received the A.B. degree from
– Karger
- 1989
|
|
1
|
was the recipient of the 1994 ACM Doctoral Dissertation Award, a 1996 National Science Foundation CAREER Award, a
– Karger
- 1997
|
|
1
|
is currently a full Professor with the Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, and a Member of the Laboratory for Computer Science
– He
- 1995
|
