Improve The General Architecture Of The Routing Algorithm Based On P2p Networks

This paper analyzes the issues in a P2P network and provides a generic solution for managing the P2P network routing even under most un-reliable network condition–"CHURN".Evaluating DHT protocols in the presence of churn is a challenge. Methodologies developed for static networks can only work when the network is stable (which is rarely the case). In this paper we have concentrated more on improving the lookup statistics (Average Hops and Success Rate) at low maintenance rate. We have provided maintenance solution to a very detailed level than any other study.In this paper, we propose a generic framework solution that can be applied to any KBR Layer routing protocol to handle CHURN. We will give good insight on CHURN and suggests the following points for the enhanced Kademlia:1. Node evenly distribution (Super Peer and Normal Peer).2. Classification of Nodes - Accounting Heterogeneity.3. Utilization of Heterogeneity factor in selecting a node for BT (low maintenance) table.4. Utilization of Virtual Server Techniques for Load Balancing Techniques (proposed) in the KBR layer. This is first attempt to handle routing overload. All the other studies mentioned load balancing at the service or application layers.5. Efficient Routing Table Maintenance technique.6. Recursive Parallel Lookups technique.