Chord A Scalable Peer-to-peer Lookup Service for Internet推荐.pdfVIP

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications  y Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT Laboratory for Computer Science chord@ /chord/ Abstract and involves relatively little movement of keys when nodes join A fundamental problem that confronts peer-to-peer applications is and leave the system. to efficiently locate the node that stores a particular data item. This Previous work on consistent hashing assumed that nodes were paper presents Chord, a distributed lookup protocol that addresses aware of most other nodes in the system, making it impractical to this problem. Chord provides support for just one operation: given scale to large number of nodes. In contrast, each Chord node needs “routing” information about only a few other nodes. Because the a key, it maps the key onto a node. Data location can be easily routing table is distributed, a node resolves the hash function by 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 communicating with a few other nodes. In the steady state, in key maps. Chord adapts efficiently as nodes join and leave