摘要： 在节点加入退出或者失效情况下，结构化P2P算法Chord搜索指向表(FT)出现大量指向错误，降低搜索效率。针对该问题，讨论和比较几种搜索 FT的更新策略，分析各算法维护指向正确的开销，提出一种懒惰算法解决搜索 FT更新效率低下的问题。该算法最小化搜索FT更新的消耗，可作为一种有效的错误恢复机制。通过实验对比证明了该算法的有效性。

关键词: 对等网络, 分布式散列表, 指向表

Abstract: As lots of errors in Chond search Finger Table(FT) appears, it depresses the searching efficiency when nodes go into or drop out. By discussing and comparing several algorithms of search FT updating, this paper proposes a lazy one to refresh the search FT recursively. The algorithm minimizes the consumption of FT refvesh, it can be an effective fault tolerance mechanism as well. Experimental result shows the correctness and effectiveness of the algorithm.

Key words: Peer-to-Peer(P2P) network, Distributed Hash Table(DHT), Finger Table(FT)

中图分类号: 

• TP393