一种改进的非结构化P2P网络洪泛搜索机制  

An Improved Flooding Based Search Mechanism in Unstructured P2P Network

作　　者：卢苇[1] 周韬[1] 邢薇薇[1] 

机构地区：[1]北京交通大学软件学院,北京100044

出　　处：《西北工业大学学报》2015年第2期342-350,共9页Journal of Northwestern Polytechnical University

基　　金：国家自然科学基金(61100143;61370128;61272353);教育部新世纪人才计划项目(NCET-13-0659);北京高校青年英才计划项目(YETP0583)资助

摘　　要：非结构化P2P网络使用基于洪泛的查询算法来进行资源搜索。然而,这种搜索机制随着网络节点的增多,网络规模的增大,将产生大量的冗余查询消息,会导致网络流量急剧增加,引起网络拥塞。提出了一种基于转发区间的洪泛搜索机制FIFSM(forwarding interval based flooding search mechanism),通过为消息分配不相交的转发区间,使其沿着一棵生成树的结构传播,消除了消息环路,从而避免冗余消息的产生。FIFSM机制采用高效的网络维护策略,能够在动态环境下以较低的开销保证网络的稳定性。实验结果表明,FIFSM机制能够降低洪泛开销,保证资源搜索的高成功率和低延迟,是一种有效的非结构化P2P网络资源搜索机制。In the unstructured P2 P networks,the flooding-based search algorithm is used to search resources; however,with increasing nodes and network scale,flooding-based search will produce large amount of redundant query messages,which will lead to heavy traffic and congestion of the network. We propose a Forwarding Interval based Flooding Search Mechanism（FIFSM）. By assigning a disjoint forwarding interval to each message,they spread along a spanning tree to avoid message loops,thus eliminating redundant messages. The efficient network maintenance strategy is presented in FIFSM; this ensures the stability of the network in dynamic environment at a very low cost. Experimental results and their analysis show preliminarily that FIFSM,as an efficient search mechanism in unstructured P2 P network,can reduce flooding overhead and achieve high success rate of resource search and low latency.

关 键 词：算法 计算机系统 资源优化 故障检测 容错性 网络管理 网络性能 丢包率 对等网络 可靠性分析 稳定性 时延 拓扑结构 非结构化P2P网络 洪泛搜索 转发区间 生成树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]