Study On Transmission Efficiency Of P2P Network Path

Recently, the peer to peer (P2P) network has become a hot research field in computer network.The research on transmission efficiency of P2P network path is an important aspect to influence the development P2P network.In network communication, a series of factors, such as the location distribution and the communication environment, influence the communication nodes between each other, which make the communication weight and time of any two communication path different in network communication.Communication time,one of key indicators to measure transmission efficiency, is very important in actual communication. In this paper, combined with the P2P technology and multicast technology, the communication efficiency algorithm of P2P network path is studied.Based on the size of weight between the paths, this algorithm can identify the minimum weights path of source node to other nodes in the network in a relatively short period of time, which achieves the shortest time that all the nodes involved in the completion of communication.Based on analyzing the P2P communication technology and two algorithms of P2P communication, this paper presents a shortest path algorithm—Kruskal algorithm based on shortest path algorithm, which can find the path from communication source to other nodes in P2P network. The introduction of the algorithm enhances the transmission efficiency of P2P network. First, we need to make the preliminary estimates to a series of factors which influence the network, such as the communication environment, the location distribution of nodes and the communication conditions and other factors,then gives a algorithm which estimates the weight between P2P network path. Secondly, we study the multicast technology in application layer, combined with the P2P needs and the advantages of application layer multicast, this paper gives a network layout strategies of P2P group communication,which effectively improves the overall efficiency of transmission efficiency. Finally, the shortest path algorithm based on Kruskal algorithm is applied to Branch First (BFI) communication tree algorithm and "Difficult-Node" Priority communication tree algorithm.The simulation results show that the transmission efficiency of the P2P communication algorithm, which uses the shortest path algorithm based on Kruskal Algorithm, is superior.