基于Gnutella动态拓扑调整的搜索策略  

A Search Strategy Based on Dynamic Topology Regularization in Gnutella Network

作　　者：顾志鹏[1] 卢豫开[2] 蒋建兵[1] 陈涛[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004 [2]广西大学信息网络中心,广西南宁530004

出　　处：《微计算机信息》2008年第15期137-138,253,共3页Control & Automation

基　　金：广西教育厅高教教改工程"十一五"项目(2005-08)

摘　　要：本文介绍了非结构化对等网络Gnutella搜索机制的工作原理,在分析其存在可扩展性问题的基础上,提出一种基于动态拓扑调整的改进策略。仿真实验表明,该策略能够有效降低网络资源的消耗,优化节点间的负载均衡,从而提高网络的可扩展性和资源搜索效率。The search mechanism of Gnutella in unstructured peer-to-peer network and its working principle are introduced. By analyzing its poor scalability problem, this paper proposes an improvement strategy based on dynamic topology regularization. The simulation results show that the strategy can effectively reduce the resource consumption of network and optimize the load-balancing among peers, and then improve the scalability of Gnutella network and the efficiency of resource search.

关 键 词：GNUTELLA 拓扑调整 搜索策略 

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