Resource Locating Model with Local Domain First in P2P Networks

This paper imports the concept of domain to design a resource locating model with local domain first based on Kademlia protocol, which is abbreviated to LDF-KAD, to refer the small world phenomenon and the characteristic of localized dataflow first on the Internet. The LDF-KAD model includes two layers structure that are super node layer and general layer. And super node layer consists of all super nodes and general node layer is made of all general nodes. By means of local domain first, a resource locating action is first done in local domain and then is next done in the closest domains if it is unsuccessful. Finally, a series of simulation experiments in this paper states that the LDF-KAD model not only has the advantage of Kademlia protocol, but also its routing and locating methods are better than Kademlia protocol´s, and the average searching length of LDF-KAD model is shorter than Kademlia protocol´s as well.