一种改进的无结构P2P网络搜索策略  

Improved search strategy for unstructured Peer-to-Peer networks

作　　者：张静 

机构地区：[1]南京邮电大学自动化学院,南京210003

出　　处：《电子测试》2011年第5期33-36,共4页Electronic Test

摘　　要：点对点(Peer-to-Peer)网络已发展成为当今最为流行的资源共享系统之一。其中的资源搜索是一个关键性问题。但其常用的基于简单flooding机制的信息资源搜索方法造成了严重的通信消耗,本文借鉴人际传播中谣言传播机制,结合节点吸引因子(在真实系统中,新增节点不仅与网络中已有的度数较高的节点连接,而且与吸引因子较大的节点连接)的特性,提出一种无结构P2P资源搜索策略。本文采用MATLAB为仿真工具,仿真结果表明,提出的搜索策略可以有效地减少无结构P2P网络中资源搜索的通信开销,并且搜索策略的覆盖度也很高。Peer-to-Peer networks have emerged as a popular way to share huge volumes of datas.Resource discovery is an essential problem in peer-to-peer networks.The common search method is flooding-based broadcasting.This method usually leads to serious communication cost problem.In this paper,we present an improved search strategy for unstructured peer-to-peer networks.This method combines interest decline mechanism in rumor spreading and the characteristic of the node’s attractive factor （In the real system,the new node not only prefers to the node with higher degree but also to the node with higher attractive factor）.We use matlab to generate simulation network in this paper.The result of the preliminary simulation shows that the communication cost of this strategy is less than the flooding algorithm.

关 键 词：无结构P2P 搜索 flooding机制 谣言传播 吸引因子 

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