Adaptive searching algorithm based on Q- routing in structured peer to peer systems
Rui Huang, Danfeng Yan, Yihui Zheng · China-Ireland International Conference on Information and Communications Technologies (CIICT 2008) · 2008
Routing efficiency is a critical issue in peer-to-peer lookup protocols such as Chord. Due to the inconsistency between the overlay and its underlying network, the routing latency is high in Chord. This paper presents an adaptive searching algorithm based on Q-routing (ASQ) that addresses this problem. Different from Chord, ASQ uses an adaptive way to choose the next hop according to Q-value and Recovery rate. And i: is also able to adapt to the dynamically changing network. Simulation results and analysis confirm that ASQ can effectively reduce lookup latency and the latency remains stable under dynamic traffic.