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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/830682 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551829310799872 |
|---|---|
| author | Wei Zhou Zilong Tan Shaowen Yao Shipu Wang |
| author_facet | Wei Zhou Zilong Tan Shaowen Yao Shipu Wang |
| author_sort | Wei Zhou |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-b6a5fbe9b6d14c5bb0346dbaaff6ae3a |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-b6a5fbe9b6d14c5bb0346dbaaff6ae3a2025-02-03T06:00:21ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/830682830682A Splay Tree-Based Approach for Efficient Resource Location in P2P NetworksWei Zhou0Zilong Tan1Shaowen Yao2Shipu Wang3National Pilot School of Software, Yunnan University, Kunming City 650091, ChinaNational Pilot School of Software, Yunnan University, Kunming City 650091, ChinaNational Pilot School of Software, Yunnan University, Kunming City 650091, ChinaNational Pilot School of Software, Yunnan University, Kunming City 650091, ChinaResource 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.http://dx.doi.org/10.1155/2014/830682 |
| spellingShingle | Wei Zhou Zilong Tan Shaowen Yao Shipu Wang A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks The Scientific World Journal |
| title | A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks |
| title_full | A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks |
| title_fullStr | A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks |
| title_full_unstemmed | A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks |
| title_short | A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks |
| title_sort | splay tree based approach for efficient resource location in p2p networks |
| url | http://dx.doi.org/10.1155/2014/830682 |
| work_keys_str_mv | AT weizhou asplaytreebasedapproachforefficientresourcelocationinp2pnetworks AT zilongtan asplaytreebasedapproachforefficientresourcelocationinp2pnetworks AT shaowenyao asplaytreebasedapproachforefficientresourcelocationinp2pnetworks AT shipuwang asplaytreebasedapproachforefficientresourcelocationinp2pnetworks AT weizhou splaytreebasedapproachforefficientresourcelocationinp2pnetworks AT zilongtan splaytreebasedapproachforefficientresourcelocationinp2pnetworks AT shaowenyao splaytreebasedapproachforefficientresourcelocationinp2pnetworks AT shipuwang splaytreebasedapproachforefficientresourcelocationinp2pnetworks |