非结构化P2P中搜索算法的性能分析  

Performance Analysis of the Search Algorithms in Unstructured P2P Systems

作　　者：欧阳柏成[1] 

机构地区：[1]贵阳学院计算机科学系,贵州贵阳550005

出　　处：《计算机工程与科学》2009年第6期67-70,共4页Computer Engineering & Science

摘　　要：资源搜索是P2P应用所面临的最核心问题之一,相关的非结构化P2P系统主要采用了查询消息泛洪和信息索引机制。本文分析了非结构化P2P中几种典型的搜索算法,阐述了其搜索原理和搜索性能。与其他研究不同,本文通过大量的模拟实验来验证搜索算法的性能;在不同网络规模中,通过对每一种搜索算法的查询成功率、搜索产生消息数和成功查询所用平均跳数进行比较分析,给出了相关结论。One of the essential problems in P2P is the strategy for resource searching. The related methods for unstructured P2P either depend on the flooding or utilize various information indices. The paper analyses a few typical search algorithms for unstructured P2P systems and introduces their search principles and performance. Differing from other studies, the paper analyses the performance of search algorithms by many simulations. The search success rate, message number and average hop number are compared for different network sizes. The related conclusion is given finally.

关 键 词：非结构P2P 泛洪 随机漫步 超节点 

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