改进的非结构化P2P网络搜索算法

如何高效地搜索资源是P2P网络中最为关键的问题.非结构化的对等网络,一般以广播方式作为其搜索的基本策略,引发较大的网络流量.针对以上问题,提出了一种利用节点积累的经验指导节点传播查询的路由搜索算法.在该算法中,通过记录节点关注的主题、主题的信息量大小和满足主题的目标节点,并建立对应关系表.当节点收到查询后,就利用该表来指导节点选择查询,以便更快地找到查询结果.仿真结果表明,该算法有效地减少了查询带来的网络流量,提高了查找的成功率.

Improved searching algorithm for unstructured peer-to-peer network

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. A new route algorithm of unstructured peer-to-peer system with routing indices is introduced. In the algorithm, a peer recorded the subject which it queried about in the past, the amount of information about this subject and who can answer the subject. When peers received a new query, it can forward the query to a selected peer which can answer the subject in the past. In the way the peer reduced the blind search. Simulation results show that the new algorithm reduces the network traffic greatly and improves the searching success ratio.