Chord: A scalable peer-to-peer lookup service for internet applications
Chord: A scalable peer-to-peer lookup service for internet applications
复制标题
DOI：
10.1145/383059.383071
复制
发表时间：
2001-10
期刊：
影响因子：
--
通讯作者：
I. Stoica;R. Morris;David R Karger;M. Kaashoek;H. Balakrishnan
中科院分区：
文献类型：
--
作者：
I. Stoica;R. Morris;David R Karger;M. Kaashoek;H. Balakrishnan
对等应用面临的一个基本问题是有效地定位存储特定数据项的节点。本文提出了一种解决这一问题的分布式查找协议Chord。Chord只支持一个操作：给定键，它将键映射到节点上。通过将关键字与每个数据项相关联，并将关键字/数据项对存储在关键字映射到的节点上，可以很容易地在Chord上实现数据定位。当节点加入和离开系统时，Chord可以高效地适应，并且即使系统不断变化，Chord也可以回答查询。理论分析、仿真和实验结果表明，Chord是可扩展的，通信开销和每个节点所维护的状态与Chord节点的数量成对数关系。
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.