一种无结构对等网络资源发现方法  

A Method for Resource Discovery in Unstructured P2P Networks

作　　者：薛冰冰[1] 俞卫华[1] 霍华[1] 

机构地区：[1]河南科技大学电子信息工程学院,河南洛阳471023

出　　处：《河南科技大学学报（自然科学版）》2013年第1期51-54,7,共4页Journal of Henan University of Science And Technology:Natural Science

基　　金：国家自然科学基金项目(60743008);河南省科技攻关基金项目(104300510063)

摘　　要：无结构对等模型应用于很多领域,但其常用的Flooding等盲目搜索方式产生大量冗余消息,限制了带宽,易造成网络拥塞。针对传统发现方法中存在的问题,提出了一种基于节点兴趣相似度的资源发现方法,在分组的基础上,根据节点的兴趣相似度将相似节点划分为域,请求消息首先在域内同组节点中转发,搜索过程中动态调整网络拓扑,有效减少路由跳数,降低冗余消息量。通过仿真试验对该方法的搜索效率进行了分析验证。Unstructured P2P model is widely used in many fields,but the common blind search method of Flooding generates lots of redundant messages.The limited bandwidth can easily cause network congestion.For the existing problems in traditional discovery method,a resource discovery method based on peer interest similarity was put forward.Based on grouping,similar peers were divided into domain on the basis of peer interest similarity.Query message was forwarded in the same group of the present domain at first,and network topology was adjusted dynamically during searching.Then route hops were reduced and the amount of redundant messages was decreased effectively.Simulation shows the searching efficiency of the method.

关 键 词：无结构对等网络 资源发现 兴趣相似度 索引 

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