计算机工程 ›› 2009, Vol. 35 ›› Issue (1): 4-6.doi: 10.3969/j.issn.1000-3428.2009.01.002

• 博士论文 • 上一篇    下一篇

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

郝黎明1,陆松年1,2,杨树堂1,2,唐俊华2   

  1. (1. 上海交通大学电子工程系,上海 200240;2. 上海交通大学信息安全工程学院,上海 200240)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-01-05 发布日期:2009-01-05

DM-Chord: Improved Routing Algorithm Based on Chord

HAO Li-ming1, LU Song-nian1,2, YANG Shu-tang1,2, TANG Jun-hua2   

  1. Electronic Engineering, Shanghai Jiaotong University, Shanghai 200240; 2. School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200240)(1. Department of
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-01-05 Published:2009-01-05

摘要: 挖掘出Chord路由协议中每一跳路由距离之间所具有的特性,在不改变节点Finger表的基础上,提出一种基于Chord的路由改进算法,DM-Chord。仿真结果表明,与Chord路由协议相比,DM-Chord能够保持与Chord接近的平均跳数,在路由源节点和路由目的节点确定且Chord处于稳定状态的情况下,该算法能够使节点转发消息所引起的负载分布更为均匀,并提高消息路由的成功率。

关键词: Chord协议, 路由, 负载均衡, 对等网

Abstract: 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.

Key words: Chord protocol, routing, load balance, Peer-to-Peer (P2P)

中图分类号: