Location Model, Based On Kademlia P2p Stratification Resources

P2P network has been becoming a heated topic dramatically in recent years. Resources locating is one of the key issue of P2P network and research. DHT-based Decentralized Structrue modle has become a focus in the research area. DHT-based methods enjoy great advantages of simplicity and extensibility. However, since the key word space is isolated from the real physical network, the mothod will disturb the data locality. As a result, while the query latency is high, the data downloading speed is low. Typical DHT-based systems include Chord, Pastry, CAN and Kademlia.This paper presents a hierarchical P2P locating mode based on Kademlia. This system consists resources-provide-layer, super-node-layer and register-server-layer. Resources-provide-layer and super-node-layer both use Kademlia to locate resources. The super-node-layer consists of super-nodes which are evaluated by regester server according to their capabilities. The resources-provide-layer is constituted of by nomal-nodes. Several nomarl-nodes constitute a domain. Normal-nodes can only locate resources in its own domain. When the course of a normal-node locating resources in its domain failed, it can be helped by the sumper-node to look up resources in super-node-layer. For the benefit of high efficieny in data locating and transporting, physically close nodes are distributed into the same domain and outside resources are re-discharged in the local domain after being downloaded from other domain.The simulator of the system in this paper is based on PlanetSim platform and java. In the end of the paper we provide the comparison of capacities between the model of this paper and Kademlia.