非结构P2P网络受限搜索机制

发布时间：2018-03-06 09:28

本文选题：Peer-to-Peer　切入点：非结构网络　出处：《软件学报》2013年09期 　论文类型：期刊论文

【摘要】：降低搜索过程中产生的大量网络开销,是非结构P2P网络重点研究内容之一.泛洪算法和随机查找算法简单且易于实现,但其在搜索过程中产生的大量冗余消息是造成大量网络开销的主要原因.针对这一问题,提出一种受限搜索机制(restricted forward search algorithm,简称RFSA),定义了搜索路径和冗余搜索路径,引入本地消息索引缓存机制,通过节点对消息的受限接收,消除节点对消息的重复接收与转发;利用搜索过程中携带的实时搜索路径信息,选择未出现在搜索路径中的邻居节点对消息进行转发,消除冗余搜索路径的产生.从理论上分析了RFSA所产生的消息数目和网络开销.模拟实验分别从网络开销、查询点击率、搜索覆盖率和产生的冗余消息数目等方面对受限机制下和非受限机制下的泛洪算法和随机查找算法进行了对比分析,结果表明,在搜索覆盖率和查询点击率基本相同的情况下,受限机制下的泛洪算法和随机查找算法能够减少大量冗余消息的产生,降低了网络开销.
[Abstract]:Reduce large amount of network overhead generated in the search process, is one of the key research contents of unstructured P2P network. Flooding algorithm and random search algorithm is simple and easy to implement, but a large number of redundant messages generated during the search process is the main reason resulting in a large number of network overhead. To solve this problem, propose a constrained search mechanism (restricted forward search algorithm, referred to as RFSA), defines the search path and redundant search path, introduce local news index caching mechanism, received by the constrained node of the message, and eliminate the repeated receiving the message forwarding node; using the search process to carry real-time search path information, neighbor node selection does not appear in the search path. The message forwarding, eliminate redundant search path generation. From the theoretical analysis of the RFSA generated by the number of messages and network overhead. Simulation experiments respectively. From the network overhead, query hits, search coverage and the number of redundant messages and other aspects of a comparative analysis of flooding algorithm of constrained and non constrained mechanism and random search algorithm. The results show that in the search coverage and query hit rate is basically the same under the flooding algorithm and random search the algorithm is limited under the mechanism to reduce the amount of redundant information, reduce the network overhead.

【作者单位】：智能通信软件与多媒体北京市重点实验室(北京邮电大学);北京邮电大学计算机学院;
【基金】：国家自然科学基金(60872051) 北京市教育委员会共建项目
【分类号】：TP393.02

【相似文献】