摘要
针对非结构化P2P网络资源搜索算法中冗余消息数过多、搜索效率低等问题,提出了一种基于邻居-邻居节点的非结构化P2P网络资源搜索策略,该策略可以在一定程度上防止路由环路的产生,同时综合考虑邻居节点的活跃度和资源命中数,选择下一条邻居节点路径转发查询消息,将查询信息发往目标可能存在的区域,因此减少了发往网络的查询信息包数量,节省了网络带宽。实验结果表明,该算法可以减少大量的冗余查询信息,提高资源搜索的成功率,是一种有效的非结构化P2P网络资源搜索策略。
For the resources search algorithm＇s too many redundant messages and low efficiency issues in unstructured P2P networks,which proposed a resources search strategy based on neighbor-neighbor node,the strategy can prevent the routing loop to some extent,meanwhile comprehensive consideration of neighbor nodes＇ activeness and resources hits to choose the next path to neighbor nodes,it sent messages to potential target areas,so the number of queries＇ packets are decreased and saving the network bandwidth.Experimental results show that,this algorithm can reduce the number of redundant queries and improve resource search success rate,it is an effective search strategy in unstructured P2P networks.
出处
《计算机技术与发展》
2010年第11期117-121,共5页
Computer Technology and Development
基金
山东自然科学基金(Y2007G11)
