Font Size: a A A

Research On Dynamic Hierarchical P2P System Based On Super-node And B+Tree

Posted on:2012-07-22Degree:MasterType:Thesis
Country:ChinaCandidate:B GongFull Text:PDF
GTID:2248330395485658Subject:Software engineering
Abstract/Summary:PDF Full Text Request
P2P namely Peer-to-Peer, it’s a self-organizing mode consist of the equivalentand autonomous end. It aims at sharing distributed resources and avoiding centeringservice in the network. Each computer of P2P network is both customer and server,so it can effectively prevent the emergence of a bottleneck and greatly improve theresource sharing degree. Because P2P technology is just gradually incline tomaturity. It brings huge impact to the rapid development of Internet technology, butit also faces many problems and challenges.According to the network topology structure, P2P networks can be divided intounstructured P2P network and structured P2P network. Unstructured P2P networkwith simplicity and robustness has loose topological structure. Because it usesflooding search strategy to location resources, it is easy to cause the systemoverflowing, low efficiency of location resources and poor scalability. Andstructured P2P network which is based on distributed hash table(DHT for short) hasclear structure, high efficiency of location resources, scalability and excellentmaintainability. But frequent node arrivals and departures cause system shock,namely Churn problem.In view of the above questions, this thesis has studied the P2P networks, themajor jobs are as follows:Firstly, based on the idea of B+tree and super node, we propose a dynamichierarchical model DHMBBS(Dynamic Hierarchical Model Based On B+Tree AndSuper-node). In this model, we propose P2P network which is build by the rule of B+tree, adopt clustering algorithm division autonomy system, adjust node identifiersdynamically, choose excellent performance node as super node and backup strategy,and state the resource positioning based on DHMBBS routing algorithm in detail.Secondly, we use simulation tools to do the simulation experiments forDHMBBS routing algorithm. Experiments result shows DHMBBS model canperform well in Search step length and node found probability, with smallermessages and hops. DHMBBS model can effectively improve the efficiency ofrouting and load balance degree, control system message quantity and avoid theappearance of Churn.Lastly, design and realize the prototype system based on the DHMBBS model, prototype system use classical DHT algorithm of Chord algorithm, containingmanagement control module, Chord node module, the system message module, datatransceiver and user UI interface of five parts. Prototype system has goodself-organizing ability.
Keywords/Search Tags:P2P, distributed Hash table(DHT), super node, B+tree, routing algorithm
PDF Full Text Request
Related items