AN ADAPTIVE SEARCHING ALGORITHM BASED ON QROUTING IN STRUCTURED PEER TO PEER SYSTEMS

摘要：

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 it 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.

关键词： peer-to-peer Chord Q-routing latency

作者: Rui Huang Danfeng Yan Yihui Zheng

作者单位: State Key Laboratory of Networking and Switching, Beijing University of Post and Telecommunication, Beijing 100876, China

会议类型: 国际会议

会议名称: China-Ireland International Conference on Information and Communications Technologies 2008(2008 中国-爱尔兰信息与通信技术国际会议 CIICT 2008)

会议地点: 北京

会议语种:英文

页码: 1-5

在线出版日期: 2008-09-26（万方平台首次上网日期，不代表论文的发表时间）