Abstract: Location of data is a heart problem in P2P field. Among many techniques of data location, distributed hash table (DHT) is most advantageous. The paper discusses most of popular techniques of data location and the benefits of DHT. It analyses the four algorithms of implementing DHT, and compares their preferences.

Key words: Peer-to-peer, Distributed hash table (DHT), Content-addressable network (CAN), Chord, Pastry, Tapestry

摘要： 数据定位是对等系统的核心问题，在诸多对等系统数据定位方法中，应用分布式哈希表接口进行数据定位的方法优点突出。论文讨论了对等数据定位的常用方法以及用分布式哈希表接口进行对等数据定位的优点，对4种实现了分布式哈希表的接口算法，即CAN、Chord、Pastry、Tapestry算法作了分析，并对这4种算法的性能进行了比较。

关键词: 对等, 分布式哈希表, 内容可定位网络, Chord, Pastry, Tapestry