DM-Chord:基于Chord的路由改进算法  

DM-Chord: Improved Routing Algorithm Based on Chord

作　　者：郝黎明[1] 陆松年[1,2] 杨树堂[1,2] 唐俊华[2] 

机构地区：[1]上海交通大学电子工程系,上海200240 [2]上海交通大学信息安全工程学院,上海200240

出　　处：《计算机工程》2009年第1期4-6,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目"信息安全增值服务平台(东部)"(2005AA145110);浦东新区科技创新基金资助项目"公共服务平台项目"(PDPT2005-04)

摘　　要：挖掘出Chord路由协议中每一跳路由距离之间所具有的特性,在不改变节点Finger表的基础上,提出一种基于Chord的路由改进算法,DM-Chord。仿真结果表明,与Chord路由协议相比,DM-Chord能够保持与Chord接近的平均跳数,在路由源节点和路由目的节点确定且Chord处于稳定状态的情况下,该算法能够使节点转发消息所引起的负载分布更为均匀,并提高消息路由的成功率。The property of routing distance among each hop is mined in Chord routing protocol. An improved routing algorithm, DM-Chord, is proposed based on Chord without modifying each peer＇s Finger table. Simulation results show that, compared with Chord protocol, DM-Chord can keep an average routing hops length similar to Chord while makes the load caused by forwarding messages to distribute more evenly and increases the routing success rate when the routing source node and routing destination node are fixed and Chord is stable.

关 键 词：CHORD协议 路由 负载均衡 对等网 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]