一种有效的无结构对等网络搜索算法  

An Efficient Search Algorithm for Unstructured Peer-to-Peer System

作　　者：曾凡秩[1] 

机构地区：[1]湖南工程职业技术学院,长沙410114

出　　处：《计算机与数字工程》2009年第11期33-35,共3页Computer & Digital Engineering

摘　　要：点对点(Peer-to-Peer)网络已发展成为当今最为流行的资源共享系统之一。其中的资源搜索是一个关键性问题。传统的方法借助本地所掌握的网络信息,利用某种搜索算法来定位资源。但是这些方法只遵循很少的搜索规则,因此不能取得理想的搜索性能。文章提出一种更为高效的预搜索忽略优化算法来搜索P2P网络。它分为两个阶段:第一个阶段进行预搜索并获取网络拓扑结构和资源的信息,第二个阶段通过已获取的信息对网络结构进行逻辑上的优化,进而更高效地搜索P2P网络。Peer-to-peer networks have emerged as a popular way to share huge volumes of data. Resource discovery is an essential problem in peer-to-peer networks. The traditional method is to use a search algorithm that locates resources based on the local knowledge about the network. But it has been based on few simple rules, so the algorithm could not achieve the desired searching performance. This paper poses a more efficient algorithm for searching P2P networks. The algorithm, termed Pre-Optimization search, which is divided into two phases. The first is the pre-searching and getting the topology of the network and resource information, the second is searching the P2P networks efficiently through the information obtained and the topology of the network.

关 键 词：无结构P2P网络 预搜索 忽略机制 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]