K-Chord:一种改进的Chord算法

K-Chord:An Improvement of chord routing algorithm

在基于结构化DHT的对等网络系统中,查找成功率和平均跳数是衡量查找效率的重要指标。本文通过对Chord协议中路由表的扩展以及查找方式的改进提出了一种改进方法。模拟试验表明,通过并行化查找,该方法能够有效提高查找效率。

In DHT based Peer-to-Peer systems,they are important marks for the success rate of searching and average hops. By extending the route table and improving the searching method of Chord,we put forward a new Chord in this paper. It shows in the simulator experiment that,by parallel searching,the searching efficiency can be greatly improved.