非结构化P2P网络搜索算法的研究与改进  

Research and Improvement of Unstructured P2P Network Search Algorithm

作　　者：袁静波[1] 石鸿伟[1] 丁顺利[1] 

机构地区：[1]东北大学秦皇岛分校计算机工程系,秦皇岛066004

出　　处：《计算机工程》2008年第22期109-111,共3页Computer Engineering

摘　　要：针对P2P软件搜索效率不高、网络带宽消耗大的问题,结合子网掩码技术,提出基于物理位置的网络拓扑结构,并介绍一种基于学习的定向查询资源搜索算法(D-searching)。该算法通过在终端节点上引入路由索引表来存储最新的资源信息与热点信息。仿真结果表明,D-Searching搜索算法在消息数、平均跳数、查询效率等方面都有较大提高。According to the low efficiency and large consumption of P2P search software, a network topology structure based on physical location is presented combined with subnet mask technology. A directional query resource search algorithm（D-Searching） based on study is also introduced, which stores the latest resource information and hot information by inserting route index table into terminal nodes. Simulation results show this D-Searching algorithm achieves improvements in the messages, the average hop and query efficiency.

关 键 词：网络拓扑结构 物理位置 定向查询 

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