The Research Of P2P Network Routing Algorithm Based On DHT

With the increase of Network size,especially in the large Interact Network Application,P2P has became an research key point because of its characteristics, such as no need to rebuild network basic equipment,low service cost,flexible configuration,expandability and so on.It's very important to find out the node which stores the wanted information quickly and efficiently.Foreign researchers has done a lot work and put forward some expandable Distributional search service,such as Chord,Pastry,CAN,Tapestry and so on.Although the implemented methods are different,the research complexity of above distributed arithmetics are all O(log₂ N).How to make it more efficient is a main question. This paper mainly studied the DHT arithmetic of P2P.Chord which is provided by MIT is easy and clear,and used widely in DNS and P2P distribute network.But some problomes affect the efficiency.So this paper improved the Chord and grouped the nodes on Chord by interest.When the nodes with similar interest are managed in one interest group,this makes high efficiency and reduces the message amount in the network.Then this paper studied Kademlia routing arithmetic which based on a novel XOR-based metric topology and improve the query efficiency.The main research content and features of this paper are:(1)Analyzed the foreign and native information about P2P technology,and studied routing algorithm which based on DHT,such as Chord,CAN,Pastry,Kademlia,Then improved the Chord and Kademlia routing algorithm.(2)Studied the size of interest group that used in the Chord routing algorithm, how to choose group leader and the influence caused by size of group. Implemented the improved routing algorithms on the PlantSim platform,and made experiments on the improved algorithms.The result shows that,with using interest grouping,the accuracy is higher,searching speed is faster and the message account is reduced.(3)Studied Kademlia routing algorithm,and improved Kademlia routing aglorithm by using quick table and weighting setting to support hot spot inquiry.Simulated kademlia to lookup the same hot spot on the PlaneSim platform, and the result shows that the improved strategy is better than the original strategy.