Popularity-driven coordinated caching in named data networking
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Who is more reliable?: an evaluation method for distributed-memory aggregation in the internet
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Distributed caching in unstructured peer-to-peer file sharing networks
Computers and Electrical Engineering
| Hi-index | 14.98 |
Peer-to-peer (P2P) systems generate a major fraction of the current Internet traffic, and they significantly increase the load on ISP networks and the cost of running and connecting customer networks (e.g., universities and companies) to the Internet. To mitigate these negative impacts, many previous works in the literature have proposed caching of P2P traffic, but very few (if any) have considered designing a caching system to actually do it. This paper demonstrates that caching P2P traffic is more complex than caching other Internet traffic, and it needs several new algorithms and storage systems. Then, the paper presents the design and evaluation of a complete, running, proxy cache for P2P traffic, called pCache. pCache transparently intercepts and serves traffic from different P2P systems. A new storage system is proposed and implemented in pCache. This storage system is optimized for storing P2P traffic, and it is shown to outperform other storage systems. In addition, a new algorithm to infer the information required to store and serve P2P traffic by the cache is proposed. Furthermore, extensive experiments to evaluate all aspects of pCache using actual implementation and real P2P traffic are presented.