A splay tree-based approach for efficient resource location in P2P networks.
Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.
National Pilot School of Software, Yunnan University, Kunming City 650091, China.
Wei
W
Zhou
National Pilot School of Software, Yunnan University, Kunming City 650091, China.
Zilong
Z
Tan
National Pilot School of Software, Yunnan University, Kunming City 650091, China.
Shaowen
S
Yao
National Pilot School of Software, Yunnan University, Kunming City 650091, China.
Shipu
S
Wang
D000465:Algorithms; D003195:Computer Communication Networks; D006801:Humans; D016247:Information Storage and Retrieval / Q000379:methods*; D020407:Internet; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012815:Signal Processing, Computer-Assisted; D013997:Time Factors