Skip to Main Content
Peer-to-peer (P2P) computing has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. Such applications have achieved a tremendous success in the past few years and the traffic generated by P2P applications is now a major portion of the Internet. This has also put unprecedented pressure on the network operators and service providers. To address this challenge, a number of P2P traffic management schemes have been proposed in recent years, among which caching and redirection are two representatives. Both of them have shown their success in theory and in practice. Yet, their implementations are largely independent, making the overall effectiveness sub-optimal. In this paper, we for the first time examine the joint implementation of these two promising solutions under a coherent framework, Tod-Cache (Traffic Orientated Distributed Caching). We show that the combination of caching and redirection can dramatically reduce the P2P traffic traversing across ISPs. Under this framework, we formulate the optimal caching and redirection problem, and show its complexity. We then present a highly adaptive and scalable heuristic algorithm which achieves close-to- optimal performance with much lower computational complexity. We extensively evaluate our framework under diverse network and end-system configurations. Our simulation results show that, under the same configuration, it can achieve at least 85% of performance of the traditional cache with at most 1/10 of the device number.