非结构化P2P系统的路由算法  

New Route Algorithms of Unstructured P2P Systems

作　　者：侯孟书[1] 卢显良[1] 周旭[1] 詹川[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054

出　　处：《电子科技大学学报》2005年第1期105-108,共4页Journal of University of Electronic Science and Technology of China

摘　　要：针对非结构化对等网络中洪泛搜索机制的路由盲目性问题,提出了一种利用节点积累的经验指导节点传播查询的路由算法。在该路由算法中,节点记录自己关注的主题和满足主题的邻居节点,建立主题与邻居节点的对应关系表,当节点收到查询后 节点就利用该表来指导节点选择查询路由,以便更快地找到查询结果。仿真试验和性能分析表明该算法有效地减少了查询带来的网络流量,提高了查找成功率。The problem of the unstructured peer-to-peer system is the scalability of the system due to network traffic cost. This paper presents a new route algorithm of unstructured peer-to-peer system with routing indices. In the algorithm, a peer records the subject which it query about in the past and who can answer the subject. When peers receive a new query, it can forward the query to a selected peer which can answer the subject in the past. In this way the peer reduces the blind search. In the end, we test our design through simulations and the result shows that our design routes the query effectively, and reduces the network traffic greatly, improve the searching success ratio.

关 键 词：对等网络 洪泛 查询 文件共享 

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