计算机应用

• 网络与通信 • 上一篇    下一篇

基于有限范围组播的Chord路由算法

段世惠 王劲林   

  1. 中国科学院声学研究所DSP中心 中国科学院声学研究所DSP中心
  • 收稿日期:2008-08-20 修回日期:2008-10-08 发布日期:2009-04-22 出版日期:2009-02-01
  • 通讯作者: 王劲林

Chord routing algorithm based on limited multicasting

Duan Shi-hui Jin-lin Wang   

  • Received:2008-08-20 Revised:2008-10-08 Online:2009-04-22 Published:2009-02-01
  • Contact: Jin-lin Wang

摘要: Chord是一种比较成功的P2P路由算法,但逻辑路径和物理路径之间的不一致性使得单纯依据逻辑距离进行节点路由导致很大的网络延迟,严重影响了路由效率。本文提出了一种基于有限范围组播的Chord路由算法,利用网络层组播技术来获得物理邻居节点,对Chord路由算法进行了改进,大幅度地缩短网络路由查找延时,有效减少了路由跳数,提高了路由性能。

关键词: 对等网, Chord, 路由, 组播, 分布式哈希表

Abstract: Chord is a successful routing algorithm, but the inconsistence between logistic routing and physical routing leads to very big network delay if the node routing only rely on logistic distance and this will seriously effect the routing efficiency. A Chord routing algorithm based on limited network layer multicasting is proposed, which uses multicast technology to obtain physical neighbor nodes and improves on Chord original routing algorithm. It can shorten network search delay greatly, reduce routing hops effectively and improve the performance of routing.

Key words: Peer-to-Peer, Chord, routing, multicast, Distributed Hash Tables (DHT)