Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
by Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, Hari Balakrishnan
url show details
Details
| type: | misc | | booktitle: | Proceedings of the {ACM} {SIGCOMM} 2001 Conference ({SIGCOMM}-01) | | year: | 2001 | | month: | jun # "~18 | | series: | Computer Communication Review | | annote: | Robert Morris (MIT Laboratory for Computer Science); David Karger (MIT Laboratory for Computer Science); M. Frans Kaashoek (MIT Laboratory for Computer Science); Hari Balakrishnan (MIT Laboratory for Computer Science); | | volume: | 31, 4 | | publisher: | ACM Press | | pages: | 149--160 | | 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. | | editor: | Roch Guerin | | address: | New York |
|
|
You need to log in to add tags and post comments.
