Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications

by: Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, Hari Balakrishnan

(2001), pp. 149-160.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

dmeister, pdlug, scottmoody, pool007, jmlon, rblake, cchhrriiss, fmc, smallbadguy, mrkoot, utopianheaven, adri, davcer, ariels, 18th-century_history_culture_and_society (group), semantic-multicast-routing (group), SNE (group), uiuc-cs (group), pedagand, gvdh, hayeah, sfuniak

Find related articles with these CiteULike tags

algorithm, algorithms, can, decentralised, decentralized, dht, distributed, fault-tolerance, good, network, networking, networks, no-tag, os, overlay, p2p, paper, peer-to-peer, performance, programming, protocol, scalability, scalable

Abstract

Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit...

@inproceedings{citeulike:92972, abstract = {Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit...}, author = {Stoica, Ion and Morris, Robert and Karger, David and Kaashoek, Frans and Balakrishnan, Hari }, booktitle = {Proceedings of the 2001 ACM SIGCOMM Conference}, citeulike-article-id = {92972}, keywords = {dht}, pages = {149--160}, posted-at = {2005-02-11 05:09:47}, priority = {3}, title = {Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications}, url = {http://citeseer.ist.psu.edu/stoica01chord.html}, year = {2001} }

RIS record

TY - CONF ID - citeulike:92972 L3 - citeulike-article-id:92972 TI - Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications T2 - Proceedings of the 2001 ACM SIGCOMM Conference SP - 149 EP - 160 N2 - Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit... KW - dht AU - Stoica, Ion AU - Morris, Robert AU - Karger, David AU - Kaashoek, Frans AU - Balakrishnan, Hari PY - 2001/// UR - http://citeseer.ist.psu.edu/stoica01chord.html ER -

RIS BibTeX