Chord: a scalable peer-to-peer lookup protocol for Internet applications
Stoica, I.
Morris, R.
Liben-Nowell, D.
Karger, D.R.
Kaashoek, M.F.
Dabek, F.
Balakrishnan, H.
Comput. Sci. Div., Univ. of California, Berkeley, CA, USA;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: Feb 2003
Volume: 11,
Issue: 1
On page(s): 17- 32
ISSN: 1063-6692
INSPEC Accession Number: 7547184
Digital Object Identifier: 10.1109/TNET.2002.808407
Current Version Published: 2003-02-25
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
