Improvement of Kademlia-based P2P Network Resource Locating Model
Lin Guan-cheng · Jisuanji gongcheng · 2008
According to Distributed Hash Table(DHT)-based P2P network resource locating methods, this paper introduces virtual node intostructured P2P system and makes the most use of regionalization of network access and contiguity of physical nodes to reduce access latency androuting length, and to optimize the routing location when the topology forms.It presents an improved Kademlia-based P2P network resource locatingmodel.The improved model is helpful to solve the problems of expandability and manageability in P2P network.It improves the efficiencies andeffectiveness of network resource.Simulation tests indicate that the improved model inherits the merits of DHT and Kademlia, and it is superior tooriginal Kademlia model in routing location, searching success ratio and average logic path length.