摘要
基于分布式哈希表(DHT)的路由算法已逐渐成为对等网(P2P)的一个热点研究领域。针对目前DHT算法中存在的路由热区问题和逻辑网络与物理网络不匹配问题,提出一种基于平衡树的路由算法Treed,引入地标将节点划分为多个区域,并基于地标区域构造平衡查找树。模拟实验表明,Treed能有效地均衡分布路由负载,并显著提高P2P系统的路由性能。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第6期106-108,111,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60072006)
关键词
对等网
平衡路由
地标区域
查找树
P2P
balanced routing
landmark region
lookup tree
