一种改进的基于新一代Gnutella网络的动态搜索算法  

An Improved Dynamic Querying Algorithm Based on the Modern Gnutella Network

作　　者：孙俊[1] 王晓东[1] 

机构地区：[1]福州大学数学与计算机科学学院,福建福州350002

出　　处：《微电子学与计算机》2007年第9期158-161,共4页Microelectronics & Computer

基　　金：福建省自然科学基金项目(A0510008)

摘　　要：新一代的Gnutella网络采用了一种双层拓扑结构,使得P2P节点之间的连接更为稠密。使用早期的洪泛搜索算法在查找频繁资源时会造成网络中查询消息包的不必要的泛滥。动态搜索算法是一种新提出的改进的算法,但搜索所花费的时间较长。针对动态搜索算法的高延时性提出了一种改进的基于贪心策略和分数制TTL的动态搜索算法。实验表明,该算法具有较好的搜索效率。As the modem Gnutella network has adopted a two-tier overlay structure, connections among peers have become denser. The use of the original flooding algorithm to search frequent resources will bring about unnecessarily enormous querying-packets in the network. The dynamic querying is an enhanced algorithm that has been proposed recently, but it will take us a long time to search the resources. In this paper, for the high latency of the dynamic querying algorithm, we propose an improved version based on the greedy strategy and the fractional TTL. The experimental results indicate that the improved algorithm has a better performance.

关 键 词：P2P GNUTELLA 动态搜索 

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