摘要
提出基于主从结构的Chord路由算法。该算法根据区域组成多个子环,在子环中推选出处理能力强的节点为超节点彼此相连构成主环。每次路由都从子环开始,然后进入主环,确定路由跳节点后,再在该节点对应的子环查找目标节点,使得大部分路由都在子环执行,避免在整个P2P环上往复跨区域查找,减少路由跳数,提高路由延时性能。
This paper proposes the Chord routing algorithm based on the main and subordinate structure. The algorithm composes many subrings according to the region. The super node is elected according to the node＇s handling abilities in the subring, and each of super nodes constitutes the main ring and connects each other. Each time the routing starts from subring, and then enters the main ring. After the routing jump node is definited, the goal node is searched in the subring to correspond this node. The majority of routing executes in the subring so that the search on the entire P2P ring which moves in the cross region back and forth is avoided and the jump numbers are reduced. The algorithm greatly enhances the routing delay performance.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第11期107-109,122,共4页
Computer Engineering
