无结构对等中网络资源发现方法研究的最新进展  

Survey on resource discover methods in unstructured P2P network

作　　者：谢满德[1] 魏贵义[1] 凌云[1] 

机构地区：[1]浙江工商大学计算机与信息工程学院,杭州310018

出　　处：《计算机应用研究》2008年第11期3214-3217,3220,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(60673179);浙江省自然科学基金资助项目(Z106727;Y105356)

摘　　要：为了提高无结构对等网络的资源查找效率,消除冗余网络流量,出现了许多查询算法。在分析这些算法特点的基础上,将它们大致分成四类:基于前向传递的方法、基于缓存的方法、基于查询和数据双重复制的方法、基于拓扑优化的方法。进一步深入分析其优缺点之后,指出任何一类查询算法都只优化了某一方面的性能,如果能将某几类方法有机集成,使它们相互补充,定能取得更好的效果。最后给出了一些重要的结论。Many search methods have been presented to avoid the large volume of unnecessary traffic incurred by the flooding- based search in unstructured P2P systems. According to the features of presented search methods, roughly divided into four categories： forwarding-base methods; cache-based methods; methods based on replication of both query and data; methods based on topology optimization. After analyzed the merits and shortcomings of all kinds of methods, the paper pointed out that any kind of search methods could only optimize a certain aspect of performance. If integrated several kinds of search algorithms smoothly, the optimization performance will be better. At last, gave some important conclusions.

关 键 词：无结构对等网络 拓扑失配 覆盖网 搜索效率 

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