Protocols for Implementing Histogram LOB in chord Networks

Abstract- Peer-to-Peer networks have grown most important now- a- days. Load balancing is the most important feature for networks. In this paper, we provide here with Load balancing techniques for Peer – to – Peer Networks. We further provide here with protocols for chord networks. Here we provide two protocols for Load Balancing techniques. Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items “randomly ” into the address space. Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized—for example, if we wish to support range searches on “ordered” keys. We give a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed. ” As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data