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

计算机工程 ›› 2008, Vol. 34 ›› Issue (6): 106-108. doi: 10.3969/j.issn.1000-3428.2008.06.039

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

基于树的平衡路由P2P查找算法

鹿 旸,陈 明   

  1. (中国石油大学计算机科学与技术系,北京 102249)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-03-20 发布日期:2008-03-20

P2P Lookup Protocol of Tree-based Balanced Routing

LU Yang, CHEN Ming   

  1. (Department of Computer Science, China University of Petroleum, Beijing 102249)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-03-20 Published:2008-03-20

摘要: 基于分布式哈希表(DHT)的路由算法已逐渐成为对等网(P2P)的一个热点研究领域。针对目前DHT算法中存在的路由热区问题和逻辑网络与物理网络不匹配问题,提出一种基于平衡树的路由算法Treed,引入地标将节点划分为多个区域,并基于地标区域构造平衡查找树。模拟实验表明,Treed能有效地均衡分布路由负载,并显著提高P2P系统的路由性能。

关键词: 对等网, 平衡路由, 地标区域, 查找树

Abstract: P2P lookup protocol based on DHT has become a hot-spot field. Focusing on the problem of hot spots and inefficient routing, a new tree-based lookup protocol Treed is presented. Treed introduces landmark in order to divide nodes into different regions, and constructs lookup tree according to landmark region. The experimental results show that Treed is highly effective in distributing routing traffic, and significantly reduces lookup latency.

Key words: P2P, balanced routing, landmark region, lookup tree

中图分类号: