Research On Key Technologies Of P2P Networks Adapted To Self-Organizing Management Mode

Since the physical network has achieved relatively high-Speed transmission and nodes have been capable of high-speed computing, Overlay networks will become the principal network mode. Overlay networks can enhance the functions and performance of the network with low-cost services and flexible deployment while need not to reform the network infrastructure, and they solve the"Tussle"problem in the Internet effectively. As a typical implementation of overlay networks, P2P network adopts a self-organizing management mode, and from the perspective of architecture it eliminates the key node failure as well as the bottleneck problem resulting from central servers. Owing to its characteristics as low cost, easy deployment, etc., researches of P2P network have attracted great attention in academes and have taken rapid progress as well.Self-organization is a fundamental property of P2P networks. Owing to self-organizing having a great impact on the availability of structure P2P networks, how to enhance the availability has been becoming an important part in the research field of P2P networks.Firstly, we review some results relevant to P2P networks and analyze existing problems as the research foundation of this paper. From the view of network architecture, we decompose availability of P2P networks enhancing into several key technologies, including P2P networks architecture, P2P routing protocol, and selfish node's behavior stimulation mechanism.From the perspective of P2P networks architecture, an interactive service-oriented P2P networks architecture (ISPNA) is proposed to analyze the key availability enhancing technologies of P2P networks and their mutual relations.From the perspective of P2P routing, in order to enhance the efficiency of routing and ensure the specialties of P2P networks such as equity between nodes, self-organizing and scalability, this paper analyzes the Hash function, conclude and apply the property that the logical relation among the destination node, the traditional semantic routing relay node sequence, and the ID of the clustering neighboring nodes. In this paper, the SCSRAA (self-organizing clustering semantic routing advanced algorithm) is proposed to improve the efficiency of semantic routing. Simulations have verified that the method can improve the semantic routing efficiently.The local views of the nodes managed in self-organization mode make the corresponding trust model hard to establish. Current trust models based on global reputation by using iterative method have high time complexity and excessive incurred packets, thus limit the scalability when applied to P2P networks. Some novel trust models based on repeated game theory are given in the paper. Under the assumption that individual peers are rational and selfish, the mechanism of trust models is described in detail. P2P networks using these trust models'scheme have a good performance and stability. Further more, compared with other types of trust model, our trust model yields both lower time complexity and fewer incurred packets. Simulations have also verified the conclusion.Finally we conclude our research works and put forward possible future research directions. Research conclusions are applied to the availability enhancement of P2P networks and applications, and have great reference value to the farther research.