Based On The Research Of Improved Algorithm Of Chord Super Node

In recent years, peer-to-peer (P2P, Peer to Peer)-as a kind of new type of network application model with its advantages, such as extendibility, high fault-tolerance is becoming more and more popular. P2P network provides a good platform for the rapid sharing resources. P2P network of resources in searching and positioning is the one of the key problems that need to be solved. In the existing peer-to-peer network resource searching model, the Chord algorithm is the second generation P2P network resources searching algorithms, it is a kind of strategy based on distributed hash table (DHT), its function is to realize the algorithm in the P2P networks, the keyword to logarit-hmic times positioning network resources. However, the existing Chord algorithm search efficiency is not high, the existence of the parallelism can’t find deficient.According to the deficiency of the Chord algorithm, proposes an improved BS-Chord (Based Super-Chord) algorithm, through improving finger table, shorten the time routi-ng, to improve the query efficiency. In addition, in BS-Chord on the basis of the algorithm, designed the corresponding the topology of the network model, through adopting binary tree said the chain structure of the storage and link common node way, so as to achieve the dithering, reduce the network load balance, solve topology mismatch goal. Research work are as follows:(1) Study the characteristics of the P2P networks model, and the realization and performance of the existing Chord algorithm, analyzed the insufficiency of Chord algorithm in application of P2P networks.(2) According to the deficiency of the Chord algorithm, puts forward the improved BS-Chord algorithm. Through the improvement of Chord algorithm finger Table, the routing information is increased in the table of the node finger, the finger to those of the domain in the table an item of values are equal to merge, making finger table as far as possible concise, shorten the processing time spent in routing on the queries of the resources of the node, increase the efficiency of inquires.(3) BS-Chord in based on the algorithm of the chain structure, design based on the network topology with second model, through the Binary tree said the chain structure of ordinary node storage and link format. And the system model into Chord and tree-Chord inside and outside two layers. According to different divided into super node node performance and common node, and more effective to improve the efficiency of resources for positioning.Finally, simulation experiments and analysis show that this scheme can improve the success rate of the search results and greatly reduce the search for required routing hop, reduce the network churn, solve the network nodes load balance problems and can better solve topology mismatch problem. In the current environment, the structured P2P strategy has certain values of promotion and research.