Research And Application Of The Improvement Of Chord

With the development of the processor speed of computer and network tecnology,more and more computers have been connected to the network.How to make good use of these computing resources has become a popular topic. In the tradional client/server network archtecture,the majority of content is stored on the central server and the client only access it,a large number of computing resources in the network are not used efficiently. Peer-to-Peer (P2P) network comes into being as a full distributed computing model.There is no special server in P2P network and nodes are able to comunicate directly with each other.P2P make good use of computing resource in network and is promised to be used for sharing resource efficiently.Research on location algorithm is the core element among many P2P research fields.Existing location algorithm can be divided into four kinds:centralized location algorithm,such as Napster;unstructed distributed location algorithm,such as Gnutella;structed distributed location algorithm,such as Chord;mixed location algorithm,such as KaZaA.The mathematical model of Chord is established in this paper after these algorithms were analyzed.Then three improvements of Chord that are suitable for different application background are proposed based on the mathematical model of Chord. What's more, we perform experiments on the performance of these improvements of Chord,and analyze the experiment results.Finally,the program of the first improvement of Chord is designed and implemented,it is used in CEPMS(Communication and Exchange Platform based on Map Service) protype system.In a word, the main contribution of this paper can be summarized...