摘要
针对无结构化P2P环境下P2P泛洪搜索的盲目性和高资源消耗性,提出一个基于路由学习的非结构化P2P搜索算法,建立两个索引表,存储三类节点信息,通过学习关联节点的信息,建立路由表,并定时与路由表内节点交换信息,减少搜索时间,降低搜索开销。理论和仿真实验证明该算法能有效地提高搜索速度,降低搜索开销。
For the P2P blindness and high resource debilitating in unstructured environment P2P search,propose a routing-based learning,unstructured P2P search algorithm,create two index tables,three types of node information stored by learning associated with the node information to build routing tables,and swap routing tables with the nodes in the routing table regularly,in order to reduce the searching time and the search overhead,Through theoretical analysis and simulation results show that this algorithm can effectively improve search speed,reduce the search overhead.
出处
《计算机与数字工程》
2010年第6期38-40,共3页
Computer & Digital Engineering