对等网络中DHT搜索算法综述

Survey of DHT search algorithm in peer-to-peer network

在P2P网路中如何快速准确地对资源进行定位是衡量其性能的一个关键。现在的分布式P2P系统普遍采取的是DHT(distributed hash table,分布式哈希表)搜索方法。基于DHT的P2P网络搜索算法的研究已经是P2P研究的一个热点。从P2P定义出发,介绍了P2P网络按照拓扑结构的分类发展;然后深入介绍了目前对等网络几种分布式哈希查找算法Chord、CAN、SkipNet和Cycloid等,并对这些算法从拓扑结构、路由复杂度、路由表大小、容错性、扩展性、负载平衡性等方面进行了评估比较;最后分析了这些算法的优缺点及今后研究的重点。

In the P2P network on how quickly and accurately positioning of resources is a measure of the performance of a key,now distributed P2P system generally is DHT search method,DHT-based P2P network search algorithm of P2P is a hot research.Based on P2P definition,this paper introduced the P2P network topology in accordance with the classification,and deeply introduced several networks such as distributed hash typical search algorithm Chord,CAN,SkipNet and Cycloid,eva-luated those algorithms from the topology,routing complexity,routing table size, fault-tolerance,scalability,load balance and so on seven aspects of the assessment.Finally,analyzed the advantages and disadvantages of these algorithms and the focus of future research.