Research Of P2P Searching Technology And Congestion Controlling Based On MRW Model

P2P technology's massive application proposed the huge challenge to the present network application. Its equivalent of the peer extrenity is bringing the internet revolution, and the research of network searching efficiency based on P2P technology promoted the more development of P2P network. Because of its widespread application in commerce and the blank exploration in many domains, like optimize collocation of enterprise resource and high effect of business management, the Inter and IBM corporations spent vast capital to research every year. It also brined the fast progress of cooperation software technology, and P2P network searching and using the resource efficiently highly is an important factor, but the rate of resource recalling is very low, like the google only 1/3. Now more and more date will be storaged into P2P, the super applications need the bottom turss to provide the ability of pivotal date orientation and searching.This dissertation is mainly focused on a new model of P2P searching and congestion controlling. At first, the paper briefly introduces the background and the development conditions of the P2P searching technology, then particularly depicts several typical model and arithmetics, and discusses their merits and shortages. Combining with the MLW model, WS small world model, NW small world model, it introduces a searching control model—P2P searching model based on Multi Limits Gather. It depicts and analyses the phenomena of congestion, optimizes the P2P searching model, also provides a solve project to congestion controlling.Currently, the P2P searching mainly include flood and random wander based on topological. The structure of MRW model is half topological. All P2P resource nodes are classed according to the resource characteristic and physics routes, and it builds a gathered, multi limits world, provides material searching arithmetic for searching in group and among group, resolves the question of dynamic network environment by the building of group connection, introduces the congestion controlling arithmetic, and a material arithmetic to the question which is produced in the process of resource transmission, which is found by the fundamental of least priority segment choosing. Then it deduces the network characteristic formulas, analyses the feasibility and advantage about the shortest path and gather characteristic. The renovating method of the system state in the dynamic network environment and integrate considering for searching and congestion controlling are the spot of innovation, and also a nodus.Finally, a variety of experimentations are given to compare and demonstrate the effectiveness of the method, introduces the application of the model.