基于Chord算法的拓扑相关改进

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. There is a problem here, the hops of these routing algorithm are logical rather than physical. A logical hop usually contains a lot of physical hops. In a large P2P network, the difference of latency between two peers is significant. Most likely a logical hop happens in the two nodes with great delay, which probably cause long-distance transmission and block the network. In this paper, we propose a topology-aware improvement on the basis of Chord, which focuses on achieving better routing efficiency. It has lower latency by appending a topology-aware Chord circle to divide topology regions. The simulation shows that the improvement has achieved lower latency per message routing.