Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications (2001) [2394 citations — 61 self]
http://www.sigcomm.org/sigcomm2001/p12-stoica.pdf
http://pdos.lcs.mit.edu/chord/papers/chord-tn.ps
http://www.csee.umbc.edu/~kalpakis/Courses/621-fa0
http://www.cs.rutgers.edu/dataman/552dir/papers/st
http://cs.wisc.edu/~suman/courses/640/papers/stoic
http://www.cs.uiowa.edu/~ghosh/chord-tn.pdf
http://www.comp.nus.edu.sg/~ooibc/courses/cs6203/c
http://www.cs.utexas.edu/users/browne/CS395Tf2002/
http://gecko.cs.purdue.edu/gnet/papers/chord.ps
http://www.lcs.mit.edu/publications/pubs/pdf/MIT-L
http://www.cs.cornell.edu/People/egs/615/chord.pdf
http://www.pdos.lcs.mit.edu/papers/chord:sigcomm01
http://nms.lcs.mit.edu/papers/chord.pdf
http://www.eecg.toronto.edu/~ashvin/courses/ece174
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Ion Stoica and Robert Morris and David Karger and M. Frans Kaashoek and Hari Balakrishnan},
title = {Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications},
booktitle = {},
year = {2001},
pages = {149--160}
}
Years of Citing Articles
Bookmarks
OpenURL
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.
