Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications

DMCA

Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ion Stoica , Robert Morris , David Liben-Nowell , David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan

Venue:	ACM SIGCOMM
Citations:	809 - 15 self

BibTeX

@INPROCEEDINGS{Stoica01chord:a,
    author = {Ion Stoica and Robert Morris and David Liben-Nowell and David R. Karger and M. Frans Kaashoek and Frank Dabek and Hari Balakrishnan},
    title = {Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications},
    booktitle = {ACM SIGCOMM},
    year = {2001},
    pages = {149--160}
}

OpenURL

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 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 and simulations show that Chord is scalable: communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.

Keyphrases

internet application scalable peer-to-peer lookup protocol data item efficient location peer-to-peer application lookup protocol data location key data item pair node scale communication cost node join fundamental problem theoretical analysis key map chord node

DMCA