Based On The Generalized Peterson Graph P2p Overlay Network Design And Analysis

Structured P2P systems use the distributed hash table(DHT) to map data into the corresponding node.As a result,structured P2P systems have efficient routing algorithms.In order to design new types of structured P2P overlay networks,the following technologies must be concerned.1:Design suitable topologies for P2P overlay networks.The current work deals with the problem of resource management in structured P2P systems.The topological properties of the overlay networks are critical factors that dominate the performance of structured P2P systems.Therefore,it is very important to design suitable topologies for networks.2:The routing and location problems of the structured P2P overlay networks.While the way of the routing and location usually depends on the two following factors:the topology structure of the networks and the design of routing table.3:Uncontrolled dynamic operations of nodes.Dynamic is one of the most important characteristics of the P2P networks,nodes joining,departing and leaving turn out continuously.In this dynamic circumstance,P2P network must establish a set of feasible and effective method to process various kinds of dynamic problems.When a new member is joining, notify the other nodes its arrival,when a node is leaving,notify the others its departure.4:Some classic structured P2P systems must maintain O(logN) neighbors,the number of neighbors, which nodes maintain,denote maintenance costs of network topology,that is to say,with the size increasing of the network,the routing table of each node will increase,which lead to expensive increase.Therefore,P2P networks attempt to design and implement a topology structure with as minimum diameter as possible.This thesis mainly studies the design and analyses in structured P2P networks and designs a new structured P2P overlay network which based on the Generalized Peterson graph.The thesis is divided into five chapters.In chapter one,we illuminate background of our study and put forward of the problems,the work we do in this paper and the structure of the paper.In chapter two,analysis some crucial techniques for designing a new structured P2P overlay network and do some research about the classic P2P overlay networks.In chapter three,we design a new structured P2P overlay network GPnet and do some research about the topology structure—Generalized Peterson graphs, analysis its characteristics simultaneously.After that,we define the key value assignment in GPnet,analysis the routing circumstances of this P2P network and detail the routing table,the routing algorithm and the routing table examples.At the same time,we do some research about the self-organization and self-adaptation such as the node joining,departing and leaving,also analysis the examples of the node joining.In the fourth chapter,show the results of the simulation experiments,such as the average routing length,topological robustness and loading balance.The experiment results indicate that GPnet has a nice performance in robustness and loading balance,meanwhile,it has a short routing length compared to Chord and CAN with the same degree in large scales of P2P networks.In the fifth chapter,we give a conclusion of this paper and mainly present the following problems for future research.