摘要
针对现有P2P检索的路由盲目性问题,提出能够适应网络可扩展性的路由查询机制。在检索过程中根据各节点的响应顺序,将每条查询路径上的回复节点信息分别保存在与它相邻的2个回复节点的路由信息表中,据此为以后的检索提供路由。在没有路由信息可用时,选择原始邻居节点进行路由,以利用原始拓扑结构的特点。实验结果表明,该机制能有效减少消息转发数量,提高信息检索的成功率。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第9期148-150,共3页
Computer Engineering
关键词
对等网络
相似度
路由信息表
Peer to Peer（P2P）
similarity
route information table
