Abstract: According to the clustering property of routing distance each hop in Chord routing protocol, this paper proposes a dynamic multi-routing algorithm based on Chord without modifying each pointer table of each peer. Result proves that this algorithm can make load more balancing caused by node forwarding message, and raises the message route’s success ratio when the route source node and the route goal node have determined, and Chord is at the steady state in the situation.

Key words: pointer table, hop, dynamic multi-routing, routing protocol

摘要： 根据Chord路由协议中每一跳路由距离之间具有的聚类特性，在不改变节点指针表的前提下，提出一种基于Chord的动态多路由算法。结果证明，当路由源节点和路由目的节点确定且Chord处于稳定状态时，该算法能使节点转发消息引起的负载分布更均匀，并提高消息路由的成功率。

关键词: 指针表, 跳数, 动态多路由, 路由协议

CLC Number: 

• TP393.04