ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Packet caches on routers: the implications of universal redundant traffic elimination
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Redundancy in network traffic: findings and implications
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Approximation Algorithms for Data Placement Problems
SIAM Journal on Computing
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching
Information Systems Research
Probabilistic in-network caching for information-centric networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Asymmetric caching: improved network deduplication for mobile devices
Proceedings of the 18th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
The default caching scheme in CCN results in a high redundancy along the symmetric request-response path, and makes the caching system inefficient. Since it was first proposed, much work has been done to improve the general caching performance of CCN. Most new caching schemes attempt to reduce the on-path redundancy by passing information on content redundancy and popularity between nodes. In this paper, we tackle the problem from a different perspective. Instead of curbing the redundancy through special caching decisions in the beginning, we take an orthogonal approach by pro-actively eliminating redundancy via an independent intra-AS procedure. We propose an \textit{intra-AS cache cooperation} scheme, to effectively control the redundancy level within the AS and allow neighbour nodes in an AS to collaborate in serving each other's requests. We show via trace-driven simulation, that intra-AS cache cooperation improves the system caching performance and reduces considerably the traffic load on the AS gateway links, which is very appealing from an ISP's perspective.