Font Size: a A A

Research On Routing Algorithm In Structured Peer-to-peer Overlay Networks

Posted on:2011-10-27Degree:MasterType:Thesis
Country:ChinaCandidate:Z H WangFull Text:PDF
GTID:2178330332460576Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
Structured P2P overlay network that according to certain logical topology of the nodes in the system interconnect is the organizational method which maintain between the nodes to interconnect on the application layer, and through routing messages make any two nodes can communicate with each other. In the P2P network, the node which the fixed physical circuit connects to pass messages directly, but each other non-neighboring nodes must go through intermediate nodes communication, the message before delivered to the destination node must pass through one or more intermediate nodes. How fast and reliable message routing to the destination node, or the location of the target resources, how to ensure the efficiency and reduce the route search process of network bandwidth occupancy rate, P2P networks have become a hot issue in the study.In this paper, the routing of P2P search algorithms Pastry in-depth study, based on the search for the routing efficiency and network bandwidth usage optimization and improvement, the paper works and results as follows:1. In order to improve the efficiency of P2P storage node in the routing of the original Pastry routing algorithm is optimized and improved. Propose a caching mechanism based on high-frequency routing search algorithm, the introduction of high-frequency cache node-set, allowing each node in the routing process can quickly search through their own and are frequently visited node routing information, thereby enhancing the efficiency of frequent access to the routing node .2. In order to make the P2P memory system maintain high efficiency routing list which must determine the survival condition of the route node through detection method of the node. For the survival of the routing node we provide a regular survey method that can count the connection information in the past and decide whether to detect or not, under the guarantee efficiency's premise, reduced the survey the number of times, thus reduce the need for network bandwidth usage.3. Finally, contrast to the experiment result with the PeerSim simulation platform, the validity of the method proposed by this paper was conformed.
Keywords/Search Tags:P2P storage system, High-frequency buffer, Node status, Regular exploration
PDF Full Text Request
Related items