Research Of P2P Routing Algorithm Based On DHT Network

Technology advancement has brought the rapid development of computer networks and computer software and hardware, which is the same as Moore law's prediction. Individual begins to rely on computer networks this large group and would like to become a member of the network and access network resources to meet personal needs.However, a variety of shortcomings in the traditional client/server model have exposed.One of the main contradictions is that the server doesn't meet the client's needs and the client's idle resources. The contradiction makes people to favor a marginalized model, that is peer-to-peer model, because P2P network is a kind of equal,free,interconnected network. The connection of people from different region is closer,easier,more convenient in P2P network. It embodies a "one for all, all for one" hero's idea.Firstly, this thesis describes resource's locating method in four different P2P network and gives a detailed analysis.Especially for the based on DHT way, scholars research mainly locating resource by DHT-based way.At the same time the thesis chooses some classical routing algorithm (Chord,CAN and Pastry) to study and analyze the maintenance mechanism of nodes'self-organization,nodes'routing,nodes'joining and nodes'departure and so on. In the process of analysing mainstream based on DHT, the thesis finds Pastry routing algorithm is a very efficient and high fault-tolerant routing algorithm, because it uses a mature the longest prefix matching algorithm and the corresponding software and hardware framework. Secondly, On the basis of structured Pastry Routing Algorithm, the articl uses small-world model's ideal and the nodes'heterogeneity, establishes an efficient,dynamic,expanding,new hierarchical clustering network model CCPastry (Centernode based Cluster Pastry). The CCPastry network model is mainly to reduce the size of the routing table and the node identifier digit in routing table, increase the index mechanism and the manageability and nodes'heterogeneous to improve routing efficiency and performance of the model. The thesis designs and describes in detail the improved hierarchical clustering of the CCPastry network model. The CCPastry network is the core of the thesis,including the introduction of model ideas,network mechanism,nodes'joining,nodes'deparure,updating maintain mechanism of routing table and routing algorithm, etc..Finally,the thesis uses a common network simulator PeerSim and simulates CCPastry model, and does a lot of test about the rationality of the model and efficiency of routing. The final experimental results verify the efficiency of the model, which reaches the thesis's writing and research purposes.