An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems

摘要

This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup latency based on the information from the neighborhoods. The updated information is used to select the next peer dynamically to route the query, which results in reducing the overall lookup latency. We implemented the scheme using the Chord, one of the most popular DHT-based peer to peer systems, and compared the performance with those of original Chord and the CFS' server selection scheme. The proposed scheme shows performance improvement over other schemes.