Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Cost-Based Analysis of Hierarchical DHT Design
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
HP2P: A Hybrid Hierarchical P2P Network
ICDS '07 Proceedings of the First International Conference on the Digital Society
A Comparative Study of Hierarchical DHT Systems
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
2T-DHT: A Two Tier DHT for Implementing Publish/Subscribe
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 02
Building efficient super-peer overlay network for DHT systems
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
A framework for interest-based community evolution and sharing of latent knowledge
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
We have earlier proposed a two-tier hierarchical DHT architecture where nodes with higher uptime and more resources dynamically form the upper tier DHT ring. Each node of this ring acts as a super node for a DHT ring of lower tier nodes. The performance of lookups for non popular data items in this type of self organizing two-tier DHT is not as good as that of flat DHT due to the uneven distribution of ring sizes at lower tier. Also, this uneven distribution leads to unbalanced load at super nodes. In this paper, we propose a dynamic node migration algorithm for forming two-tier DHT which ensures even distribution of ring sizes at lower tier. Our proposed migration algorithm includes mechanisms for merging smaller rings and splitting bigger rings. Further, this even distribution of lower tier ring sizes leads to improved load balancing among super nodes. Simulation results indicate that this modified two-tier DHT architecture performs better than flat DHTs in terms of mean hop count to lookup non popular data items.