非结构化对等网信息缓存资源查找算法

Information Catch Routing Algorithm in Unstructured Peer to Peer Network

泛洪式路由(Flooding)是在非结构化对等网络中进行有效资源查找的主要方式,但其路由过程将产生大量冗余消息,因而严重制约了其可扩展性.随节点数增多,泛洪式路由的网络带宽消耗也变得异常严重.为此,本文提出了改善非结构化对等网络路由和查找效率的LHC(LookaHead with Catch)算法,该算法利用缓存邻居节点的邻居列表和邻居节点的资源索引表,达到优化路由的目的.仿真实验表明,在保证维护和查询的带宽开销与现有算法基本一致的基础上,LHC算法不仅更有效的减少了查询过程中产生的冗余消息,而且在网络容量一定的情况下,资源命中率更高.

Flooding which is used in unstructured Peer to Peer Network for searching and locating information is a primary routing algorithm. But the routing produces a large number of redundant messages so that it restricts the P2P networks＇ expansibility. Moreover,with the increment of the number of nodes, the consumption of network bandwidth in unstructured P2P network has become a serious problem. This paper proposes the LHC（lookahead with catch） algorithm which optimizes the routing by catching neighbor＇s neighbor and neighbor＇s resource information. In addition,the simulation results show that LHC algorithm not only can reduce redundant information resulting from the query process effectively in the same situation of bandwidth cost, but also find more resources than flooding routing algorithm does.