Chord: A scalable peer-to-peer lookup service for internet applications Export

@inproceedings{stoica01chord, 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.}, address = {New York, NY, USA}, author = {Stoica, Ion and Morris, Robert and Karger, David and Kaashoek, Frans M. and Balakrishnan, Hari}, booktitle = {SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications}, citeulike-article-id = {449308}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=383071}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/383059.383071}, doi = {10.1145/383059.383071}, isbn = {1-58113-411-8}, keywords = {chord, content-addressable, networks, p2p, protocols}, location = {San Diego, California, United States}, month = {October}, number = {4}, pages = {149--160}, posted-at = {2008-08-27 15:01:35}, priority = {0}, publisher = {ACM}, title = {Chord: A scalable peer-to-peer lookup service for internet applications}, url = {http://dx.doi.org/10.1145/383059.383071}, volume = {31}, year = {2001} }

TY - CONF ID - stoica01chord L3 - citeulike-article-id:449308 N2 - 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. CY - San Diego, California, United States IS - 4 SN - 1-58113-411-8 AD - New York, NY, USA EP - 160 TI - Chord: A scalable peer-to-peer lookup service for internet applications PB - ACM VL - 31 T2 - SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications SP - 149 KW - chord KW - content-addressable KW - networks KW - p2p KW - protocols AU - Stoica, Ion AU - Morris, Robert AU - Karger, David AU - Kaashoek, Frans AU - Balakrishnan, Hari PY - 2001/10// UR - http://dx.doi.org/10.1145/383059.383071 ER -