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.

[1]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[2]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[3]  Ramesh Govindan,et al.  Incrementally improving lookup latency in distributed hash table systems , 2003, SIGMETRICS '03.

[4]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

[7]  Gurmeet Singh Manku,et al.  Optimal routing in Chord , 2004, SODA '04.

[8]  Gennaro Cordasco,et al.  F-Chord: Improved Uniform Routing on Chord , 2004 .

[9]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[10]  Emin Gün Sirer,et al.  Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays , 2004, NSDI.

[11]  Mihalis Yannakakis,et al.  How good is the Chord algorithm? , 2010, SODA '10.

[12]  Giovanni Chiola,et al.  Optimizing the finger table in chord-like DHTs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[13]  Miguel Castro,et al.  Dynamic Lookup Networks , 2003, Future Directions in Distributed Computing.

[14]  Erik D. Demaine,et al.  EpiChord: parallelizing the chord lookup algorithm with reactive routing state management , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).