一种信任优化搜索的p2p节点资源定位算法

Trust Optimization Search p2p Node Localization Algorithm

传统HDHT方法采取信任机制完成异构节点资源定位,在节点选择初期信任尚未建立时,一些处理能力较弱的节点会发生拥塞,从而严重影响到搜索算法的性能。为此,提出一种信任优化搜索的p2p节点资源定位算法,其以信任度为基础,建立一个搜索区间,在每一次的搜索过程中,利用Direct_Search对搜索方向进行优化,保证每个节点都能沿着信任度最优化方向被搜索,避免在传统算法下由p2p网络异构分布造成节点被重复搜索的弊端。实验表明,此算法不仅在信任建立初期可以提高节点的资源搜索效率,并且可以在信任建立以后,提高下载成功率。算法在p2p的查询周期平台上得以实现,并通过实验分析了算法的有效性。

The traditional method HDHT uses trust mechanism to complete isomerism node location of the resources. When the node selection initial trust is yet not established, some processing power weaker node will generate conges- tion. Node congestion phenomenon will severely affect the performance of the search algorithm. This paper put forward a trust optimization search p2p node localization algorithm, which is based on credibility, establishes a search interval, in every search process, uses the direct search to optimize the search direction, to ensure that each node can be searched a- long the trust optimization direction, avoid the disadvantages of repeatly searching node due to p2p network heterogene- ous distribution in the traditional algorithm. Experimental results show that this algorithm not only in the initial trust establishment can improve the node resources search efficiency, but also can improve download success rate after setting up trust. Algorithm can be realized in p2p query cycle platform,and the experimental analysis verifies the effectiveness of the proposed algorithm.