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

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

Cached

Download Links

Other Repositories/Bibliography

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

Citations:

3028 - 66 self

BibTeX

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

Years of Citing Articles

Bookmark

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, 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.

Citations

2353	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1567	Randomized Algorithms - Motwani, Raghavan - 1995
854	Resilient overlay networks - Andersen, Balakrishnan, et al. - 2001
847	Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
778	Wide-area cooperative storage with cfs - DABEK, KAASHOEK, et al.
773	Freenet: A distributed anonymous information storage and retrieval system - Clarke, Sandberg, et al. - 2000
522	A scalable location service for geographic ad-hoc routing - Li, Jannotti, et al. - 2000
438	Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web - Karger, Lehman, et al. - 1997
422	Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
417	The design and implementation of an intentional naming system - Adjie-Winoto, Schwartz, et al. - 1999
241	The synchronization of periodic routing messages - Floyd, Jacobson - 1994
191	Development of the domain name system - Mockapetris, Dunlap - 1988
89	A prototype implementation of archival intermemory - Chen, Edler, et al. - 1999
85	Building peer-to-peer systems with chord, a distributed lookup service - Dabek, Brunskill, et al. - 2001
79	XDR: External data representation standard - Srinivasan - 1995
38	A Distributed Decentralised Information Storage and Retrieval System - CLARKE - 1999
34	Algorithmic design of the Globe wide-area location service - Steen, Hauck, et al. - 1998
29	A.: The globe distribution network - Bakker, Amade, et al.
21	Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to - DRUSCHEL, ROWSTRON - 2001
16	Consistent hashing and random trees: Algorithms for caching in distributed networks - LEWIN - 1998
9	Separating key management from file system security - eres, Kaminsky, et al. - 1999
2	decentralized peer-to-peer sharing. http://www.ohaha.com/design.html - Ohaha
1	Building peer-to-peer systems with Chord, 43 distributed location service - Dabek, Brunskill, et al. - 2001