Font Size: a A A

Research An Improvement Of Chord In P2P Network

Posted on:2012-07-11Degree:MasterType:Thesis
Country:ChinaCandidate:W J CengFull Text:PDF
GTID:2248330395984919Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
In recent years, peer-to-peer network (P2P, Peer to Peer) as a kind ofnew type of network application model with its extendibility, advantages,such as high fault-tolerance becomes more and more popular. P2P networkprovides a good platform for sharing resources rapidly. Searching andpositioning resources in P2P network is the key problems to be solved.Current searching model, the Chord algorithm, is the second generationP2P network resources search algorithms. It is based on the distributedhash table (DHT) strategy; its function is to realize the algorithm in theP2P networks, the keyword to logarithmic times positioning networkresources. However, current Chord algorithm search model is not efficient,and can’t find parallelism deficient.Aiming at solving the deficiency of the Chord algorithm, the thesisproposes an improved MS-Chord (Multiple Super-Chord) algorithm,through improving finger table, shortening the time routing, to improvethe query efficiency. In addition, on the basis of the algorithm, the thesis designs the corresponding the topology of the network model, throughadopting binary tree said the chain structure of the storage and linkcommon node way, so as to achieve the dithering, reduce the network loadbalance, solve topology mismatch goal. I got four steps to analysis of thispaper:A deep research is made on the characteristics of the P2P networksmodel, and the realization of the existing Chord algorithm andperformance, analyzing the Chord algorithm in P2P networks in theapplication of insufficient.The thesis puts forward the improved MS-Chord algorithm,based onMS-Chord algorithm. Through the improvement of Chord algorithm fingerTable, the table in the node finger increased in the routing information, thefinger to those of the domain in the table an item of values are equal tomerge, making finger table as far as possible concise, shorten the node ofthe resources of information on when routing queries spent the processingtime, increase inquires the efficiency. Through the theoretical andexperimental analysis, MS-Chord algorithm is superior query efficiency Chord algorithm.Based on MS-Chord, a network topology based on chain structure isdesigned. Through the Binary tree said the chain structure of ordinarynode storage and link format. The system model consists of inter-Chordand tree-Chord, it is divided to inside and outside layers. Thus super nodeperformance and common node are distinguished, and it improves theefficiency of resources positioning.Finally, simulation experiments and analysis shows that this schemecan improve the search results, greatly reduce the search for requiredrouting hop, reduce the network dithering sex, solve the network nodesload balance problems, and better solve topology mismatch problem. Inthe current environment, the structured P2P strategy has certainlypromoted use and research value.
Keywords/Search Tags:p2p, Chord, super node, Binary sort tree, Network quiversproblem
PDF Full Text Request
Related items