基于兴趣子网的Gnutella网络资源定位的研究  

Research for resource location in Gnutella network based on interest subnet

作　　者：高飙[1] 徐家品[1] 

机构地区：[1]四川大学,四川成都610065

出　　处：《计算机工程与设计》2009年第17期3992-3995,共4页Computer Engineering and Design

摘　　要：从资源定位的准确性、有效性出发,分析了当前一些有关Gnutella网络的主要的资源搜索算法,提出了一种基于兴趣子网的非结构P2P网络资源定位的新算法。该算法借助带权值的路由信息反向植入策略以及引入的引导节点查询策略,有效地避免了网络中出现单点失效的现象,并在保持高速查询、高命中率的同时大大减少了查询信息量和延时,从而提高资源搜索效率,降低网络带宽消耗,减轻网络拥塞。From the perspective ofaccuracy, efficiency ofresource location, some current resource search algorithrns in Gnutella network is analyzed firstly. Then a new resource location algorithm based on interest subnet in unstructured P2P network is proposed. In this new algorithm, a reverse-planting routing strategy with weight and a guider-search strategy are introduced. With keeping the ability of high hit-rate, quick query, this algorithm solve the problem of single node＇s fault as well as efficiently reduce the query information redundancy and high delay in Gnutella system, Hence the algorithm proposed can do a significant job in enhancing the search efficiency and reducing the bandwidth consumption and the network jam.

关 键 词：资源定位 非结构P2P网络 兴趣子网 引导节点 反向植入 

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