HP-Chord: A Peer-to-Peer Overlay to Achieve Better Routing Efficiency by Exploiting Heterogeneity and Proximity

Feng Hong, Minglu Li, Xinda Lu, Jiadi Yu, Yi Wang, Ying Li

Abstract: Routing efficiency is the critical issue when constructing peer-to-peer overlay. A peer-to-peer overlay, called HP-Chord, is illustrated in this article which aims to achieve better routing efficiency. HP-Chord is built on the basis of Chord overlay, which makes use of the heterogeneity of the bandwidth of the nodes and exploits the proximity of the underlying network. The simulation shows that HP-Chord has achieved better routing efficiency than standard Chord overlay on two aspects, which are lower number of hops and lower RDP per message routing.