Research Of CACHE Cooperation In P2P Network

The rapid development of P2P networks attracts people's great interest. The P2P services, such as P2P file sharing, P2P live video and video on demand, generate a lot of P2P network traffic flow. Most of the bandwidth of ISP is taken by P2Pservices. The P2P applications have brought the heavy financial and administrative burden to the ISP. P2P network traffic requires a more optimal algorithm. The former strategy that consider the link simply has been stretched, some ISPs manage to block the P2P traffic flow, but this will significantly reduce the users'satisfaction, it is obvious that the effect of a single cache is limited while cooperate cache could play better.In order to improve the satisfaction of customers and reduce the network load, a solution of the P2P network flow is trying to reach the entire network flow localization through cooperation between P2P caches. This paper focuses on P2P networks cache storage, and improves the network performance fundamentally, optimizes network traffic, accelerates P2P content distribution networks, while reducing the bandwidth on the link.In this paper, cache cooperation algorithm is studied in hierarchical network topology, on base of the traditional cache storage algorithm. A new type of cooperative cache algorithm named newGreedy-2 has been brought out. Then it has been simulated in hierarchical network topology, the performance of network has been analyzed. According to previous algorithms, the following conclusions have been obtained, 10.33% increase in the network transmission costs, 26% increase in the network link utilization, 27% increase in the local hit rate and 22.45% increase in the network throughput, the performances have been improved significantly. Finally, the rules of the collaborative of cache storage have been concluded. This paper has certain significance for storage of P2P network and cloud computing in the future.