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/964723.383071
复制
发表时间：
2001-10-01
影响因子：
2.8
通讯作者：
Balakrishnan, H
中科院分区：
文献类型：
--
作者：
Stoica, I;Morris, R;Balakrishnan, H
对等应用程序面临的一个基本问题是有效地定位存储特定数据项的节点。本文介绍了和弦，分布式查找协议，解决这个问题。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.