Anonymous Commnicate System Based On P2P Network

With the development of information technology, the networks warfare, that aims at the computer system and the computer network, and engages in all kinds of information attack and defense by way of information technology across the whole network, has already appeared on the war stage. The network has become a new battlefield and platform. P2P (peer-to-peer) network is a network model rising in recent years, and is now the focus of researches and attentions. It has found wide application in many areas, and shown favorable development prospects. In the P2P system, the difference between the client and the server or the middle-layer is disappeared. Every node in a P2P system, which has full self-rule and complete equality with each other, is responsible of the client role and the server one.This paper takes the network warfare as study background, effectively combines P2P network with anonymous communication system, and building the network war system that has a high safety, efficiency and robustness. The main contents of this paper can be summarized as follows: proceeding from the P2P network, We analyse the feasibility of this application that the P2P network is used in the network warfare, and generalize relevant demands. Then, we give emphasis to the P2P network topology, design the system topology of two layers,and make a deep study of the routing algorithms. In our system,we design the hash network routing algorithms by means of improving the Chord protocol. At last, design the anonymous communication algorithm based on the hybrid structure of the P2P network. Therefore the safety of the system are further improved.The following are the main research of this paper:1. Good network topology control. This system use the network topology of two layers, with the lower layer being centralized topology and the upper being decentralized unstructured topology. When the nodes join and leave frequently, the network topology remains relatively stable.2. Efficient communication quality. We introduce the agency node and the DHT algorithm together into this system, and effectively combine them. Accordingly, we realize the mechanism of the devisions of the network into groups and the devisions of the group into layers. In this way, even if the network nodes and resources continuously change, we can still search, locate them efficiently, and ensure the load balance of the all network.3. Reliable safety of the system. In the anonymous communication algorithm that achieves the anonymous communication between the network nodes, we introduce the group key agreement protocol during the creation of the path, and the P2P network nodes are selected randomly and change continuously, so it is difficult to damage the communication anonymity unless the attacker can control the whole P2P network.The design thoughts of this anonymous communication system based on the P2P network is new and original, and the design method is flexible and effective. The following are the significant meaning of this paper:1. High usefulness of the system. This system not only fully reflects the P2P network's characteristics of extendibility and withstanding attack, but also advances the workable solution of the series of safety problems, for example: the network routing algorithm, the anonymous communication, the protection of privacy. So this system received the good results in the real network warfare.2. Good system performance. The system can play well the advantages of P2P networks, and solve the P2P network deficiencies to some extent. This paper make the comprehensive use of the structured topology model and the unstructured one, sovle many problems of the traditional network, and can enlighten the future study on the network topology.3. Worth using for reference. Currently, the distributed computing, particularly the grid computing is a very focused direction in the study field. The P2P technology and the Grid technology have many similarities, and we believe this system will be designed to play a useful reference.