一种P2P资源搜索的改进方法

An Improved Searching Algorithm for Peer-to-Peer Network

如何高效地搜索资源是P2P网络中最为关键的问题。非结构化的对等网络,一般以广播方式作为其搜索的基本策略,引发较大的网络流量。针对以上问题,提出了一种在节点建立跳转路由表的方法进行搜索的算法。在该算法中,将每个转发消息的节点都看成是一个路由,将网络中某些特定性质的节点作为特征点,把网络中的特征点信息作为默认值,保存在节点的路由表的默认值项中,并根据网络具有动态变化的特性,采用了动态路由主动发现网络中的变化,并把系统中发生的变化进行更新,存储到路由表中,为进行动态路由提供信息。仿真结果表明,该算法有效地减少了查询带来的网络流量,提高了查找的成功率。

How to search the resources efficiently is the key problem in peer-to-peer networks. Unstructured peer-to-peer networks usually use broadcasting as its basic search strategy and cause a larger network flows. An improved algorithm of unstructured peer-to-peer system with Next-Hop routing is introduced. In the algorithm, every peer is seen as a router and builds its own route table. Special peers is found and is stored their information in default row of the route table. The method of Dynamic route is used to initiatively get the network changes and is stored those in the route table. Simulation results show that the new algorithm reduces the network traffic greatly and improves the searching success ratio.