Chord: a scalable peer-to-peer lookup protocol for Internet applications Export

@article{citeulike:696676, 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.}, author = {Stoica, I. and Morris, R. and Liben-Nowell, D. and Karger, D. R. and Kaashoek, M. F. and Dabek, F. and Balakrishnan, H.}, citeulike-article-id = {696676}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/TNET.2002.808407}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1180543}, doi = {10.1109/TNET.2002.808407}, journal = {Networking, IEEE/ACM Transactions on}, number = {1}, pages = {17--32}, posted-at = {2006-08-22 06:36:32}, priority = {2}, title = {Chord: a scalable peer-to-peer lookup protocol for Internet applications}, url = {http://dx.doi.org/10.1109/TNET.2002.808407}, volume = {11}, year = {2003} }

TY - JOUR ID - citeulike:696676 L3 - citeulike-article-id:696676 N2 - 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. IS - 1 JF - Networking, IEEE/ACM Transactions on EP - 32 TI - Chord: a scalable peer-to-peer lookup protocol for Internet applications VL - 11 SP - 17 AU - Stoica, I AU - Morris, R AU - Liben-Nowell, D AU - Karger, DR AU - Kaashoek, MF AU - Dabek, F AU - Balakrishnan, H PY - 2003/// UR - http://dx.doi.org/10.1109/TNET.2002.808407 ER -