基于dht的p2p网络资源搜索问题研究-计算机应用技术专业论文.docxVIP

基于 DHT 的 P2P 网络资源搜索问题研究 RESEARCH ON RESOURCE SEARCH OF P2P NETWORK BASED ON DHT ABSTRACT P2P is peer to peer , one of new computer network technology research hot spot. There are a lot of shared resources in P2P networks, and the resource search problem is how to locate the resource that can meet the requirement of client among those resources. Based on distributed hash table as the important technology in P2P network resource search has received widely concerning. Chord, Pastry, CAN, and Tapestry are the classical algorithm of P2P network resource search technology that basing on DHT. We find that when the query occurs between two poor performance nodes, as the constraints of their own resource, it will result in significant network delays so as to affect query efficiency; In addition, chord lookup algorithm as one-way searching will jump many times when the destination is very far, and it increases the routing hops. For the Chord existing problems, this paper proposes an improved algorithm—bidirectional master-slave chord algorithm and it does two improvements for chord: firstly, it draws the idea of super-node for the topological structure, so we can divide network nodes into super-nodes and ordinary nodes, the super-nodes should be capability of processing and good bandwidth, and it makes up of chord primary ring and supervises the ordinary nodes, so super-nodes and ordinary nodes together constitute master-slave chord structure, then the ordinary nodes query can be handled through super nodes so as to reducing the routing delay. Secondly, for searching directions, we improve the one-way searching of chord by adding a reverse routing table into bidirectional searching method. For the new algorithm, the node can find messages either clockwise direction but also counter-clockwise. When the destination node is located in the clockwise second half ring, it will decrease the number of hops count by counter-clockwise than clockwise. Then, we can see that selecting a r