基于分散网坐标的P2P搜索算法

The P2P Search Algorithm based on Decentralized Network Coordinate

对结构化P2P网络模型Chord的搜索算法进行讨论,指出其优点和不足。对于其搜索算法中存在的覆盖网络和底层网络不一致而带来的查询延时问题,本文结合Chord在拓扑结构和数据分布等方面的特点,以分散网坐标为基础,提出了基于分散网坐标的搜索算法,使搜索向着延迟相对小的节点进行。实验证明,基于分散网坐标的搜索算法使查询的路由跳数更少,路由延迟更小,查询效率也更高。

This paper discusses the topology of structured P2P network model and the corresponding search algorithms, and points out the advantages and disadvantages. The query latency issue exits in the Chord model which is brought by overlay networks and the underlying network inconsistencies. This paper uses the characteristics of the Chord topology and data distribution, bases on the decentralized network coordinate to modify the traditional Finger Table, and proposes the search algorithm based on decentralized network coordinate, which makes the search towards to the relatively small delay nodes. Experiment shows that the query hops are less, the routing delay is smaller, and the query efficiency is also higher.