Chord: a scalable peer-to-peer lookup protocol for Internet applications

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 11; no. 1; pp. 17 - 32
Main Authors: Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.
Format: Journal Article
Language:English
Published: New York IEEE 01.02.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Analytical models
Application software
Centralized control
Computer science
Costs
Internet
Network servers
Peer to peer computing
Protocols
Routing
ISSN:1063-6692, 1558-2566
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2002.808407