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

DMCA

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

Cached

Download Links

Other Repositories/Bibliography

DBLP

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

Citations:

4447 - 69 self

BibTeX

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

OpenURL

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

Keyphrases

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

DMCA