Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.