Hierarchical DHT to efficiently load balancing in dynamic peer-to-peer environment

Abstract

There has been tremendous interest in emerging Peer-to- Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution and applicationlevel multicast applications. P2P networks offer an efficient routing architecture that is massively scalable, self-organizing, and robust. It also provides fault tolerance. Structured peer-to-peer (P2P) such as Chord organizes peers into a flat overlay network and offer distributed hash table (DHT) functionality. Basically in this system, data is associated with keys and each peer is responsible for a subset of the keys. In Hierarchical DHTs peers are arranged into groups, and each group has its autonomous intra-group overlay network and lookup service. Compare to flat DHT systems, hierarchical systems can efficiently distribute the load among different peers. It is also observed that peers join and leave the P2P network frequently, which affect the structured network. In this paper, we are proposing the architecture which can efficiently balance the load among peers, also it can handle the frequent joining and leaving of peers in P2P system. © Springer-Verlag 2011.