Research of Network-delay-based P2P Routing Algorithm
基于网络延迟的P2P路由算法的研究

In recent years, most network bandwidth has been consumed by Peer-to-Peer (P2P)computing applications rather than WEB applications. However, peers in P2P systems choose logical neighbors randomly without any knowledge about underlying physical topology at present, which can decrease greatly the efficiency of message routing and consume more bandwidth. According to the principle that the neighbor peer in logical is also the physical neighbor, an improved Chord construct algorithm DeChord, is proposed. In DeChord, Global Network Position is utilized to compute the coordinate of peers, and then the distance between nodes is computed based on these coordinates. The consistency between logical distance and physical distance is considered when nodes join the system and the closer peers in the physical network are taken as neighbor peers. DeChord makes the information of routing table updated in time. DeChord can decrease the latency of every hop, therefore the latency of total message routing is decreased. Simulation results indicate that the performance of data location in the system that is constructed by DeChord can be significantly improved.