作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (9): 148-150. doi: 10.3969/j.issn.1000-3428.2008.09.053

• 网络与通信 • 上一篇    下一篇

基于P2P的路由查询机制

孟宪福,王迎春,史 磊   

  1. (大连理工大学计算机科学与工程系,大连 116024)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-05-05 发布日期:2008-05-05

Routing Querying Scheme Based on P2P

MENG Xian-fu, WANG Ying-chun, SHI Lei   

  1. (Department of Computer Science and Engineering, Dalian University of Technology, Dalian 116024)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-05-05 Published:2008-05-05

摘要: 针对现有P2P检索的路由盲目性问题,提出能够适应网络可扩展性的路由查询机制。在检索过程中根据各节点的响应顺序,将每条查询路径上的回复节点信息分别保存在与它相邻的2个回复节点的路由信息表中,据此为以后的检索提供路由。在没有路由信息可用时,选择原始邻居节点进行路由,以利用原始拓扑结构的特点。实验结果表明,该机制能有效减少消息转发数量,提高信息检索的成功率。

关键词: 对等网络, 相似度, 路由信息表

Abstract: A routing querying scheme that can adapt to the extension of network is proposed to attack the problem of blind routing in P2P search. During the course of searching, the information of every replying node is saved in route tables of its two neighborhood nodes respectively according to the responding order, and which is used to guide the following routing. Initial neighborhood node is chosen to route in case of no information available, which makes use of the characteristics of the initial topology. Experimental results manifest that the scheme can reduce the number of messages in the network and improve searching performance effectively.

Key words: Peer to Peer(P2P), similarity, route information table

中图分类号: