计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (28): 120-122.DOI: 10.3778/j.issn.1002-8331.2009.28.035

• 网络、通信、安全 • 上一篇    下一篇

自适应的P2P网络路由方法研究

吴亚辉,邓 苏,黄宏斌   

  1. 国防科技大学 信息系统与管理学院,长沙 410073
  • 收稿日期:2008-05-28 修回日期:2008-09-26 出版日期:2009-10-01 发布日期:2009-10-01
  • 通讯作者: 吴亚辉

Research of adaptive routing method on P2P network

WU Ya-hui,DENG Su,HUANG Hong-bin   

  1. College of Information Systems and Management,National University of Defense Technology,Changsha 410073,China
  • Received:2008-05-28 Revised:2008-09-26 Online:2009-10-01 Published:2009-10-01
  • Contact: WU Ya-hui

摘要: 在分析一系列P2P网络资源发现方法的基础上,提出了一种基于查询的P2P网络路由方法(Query-based Routing Method in P2P network,QRM方法)。在该方法中,节点会记录收到的查询以及满足该查询的节点,在这些节点中,优先存储那些距离较远的节点。仿真实验表明,随着查询的增多,该方法能有效地提高查询效率。

关键词: 对等网, 语义相似度, 路由表, 搜索方法, LightFlood

Abstract: After analyzing a series of methods about resource discovery in P2P network,this paper proposes a query-based routing method in P2P network.In this algorithm,the node records the received query and the nodes that can answer the query very well,in these nodes,those that have longer distance are recorded firstly.Simulation experiments demonstrate that the method can enhance the searching efficiency very well with the number of queries becoming more and more.

Key words: Peer-to-Peer(P2P), semantic similarity, routing table, searching method, LightFlood

中图分类号: