Improvement of Kademlia Based on Physical Location

Kademlia is one of the most popular routing algorithm based on DHT in P2P network research. It specifies the structure of the network and the exchange of information through node lookups. With the unique identifying pattern of nodes which kademlia adopts and XOR metric for distance, it contacts only O(log(n)) nodes during the search out of the total of n nodes in the system. The neighboring nodes in the network based on Kademlia are not always physical neighbours so that the delay between nodes is affected. In this paper, we put forward to a new model of Kademlia based on physical information. It re-construct the Kademlia model reasonably with the idea of making the nodes which are closed in physical network approach in the network in the logic topology. As a result, it will lower routing delay. We describes the structure and its query routing algorithm. Our query routing strategies are proved effective in our case studies mentioned in this paper.