Popularity-driven coordinated caching in named data networking

Authors:
Jun Li;Hao Wu;Bin Liu;Jianyuan Lu;Yi Wang;Xin Wang;YanYong Zhang;Lijun Dong
Affiliations:
Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijng, China;State Univ. of New York, Stony Brook, NY, USA;Rutgers University, North Brunswick, NJ, USA;Rutgers University, North Brunswick, USA
Venue:
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Year:
2012

Citing 10
Cited 1

Analysis of web caching architectures: hierarchical and distributed caching

IEEE/ACM Transactions on Networking (TON)
Performance Analysis of Communications Networks and Systems

Performance Analysis of Communications Networks and Systems
Insight and perspectives for content delivery networks

Communications of the ACM - Personal information management
Traffic modeling and proportional partial caching for peer-to-peer systems

IEEE/ACM Transactions on Networking (TON)
Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic

IEEE Transactions on Parallel and Distributed Systems
A measurement study of the origins of end-to-end delay variations

PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Design and Evaluation of a Proxy Cache for Peer-to-Peer Traffic

IEEE Transactions on Computers
Modelling and evaluation of CCN-caching trees

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Modeling Internet topology

IEEE Communications Magazine

Hash-routing schemes for information centric networking

Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The built-in caching capability of future Named Data Networking (NDN) promises to enable effective content distribution at a global scale without requiring special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better performance at both the network layer and application layer. With the specific objective of minimizing the inter-ISP (Internet Service Provider) traffic and average access latency, we first formulate the optimization problems for different objectives and then solve them to obtain the optimal replica placement. Then we develop popularity-driven caching schemes which dynamically place the replicas in the caches on the en-route path in a coordination fashion. Simulation results show that the performances of our caching algorithms are much closer to the optimum and outperform the widely used schemes in terms of the inter-ISP traffic and the average number of access hops. Finally, we thoroughly evaluate the impact of several important design issues such as network topology, cache size, access pattern and content popularity on the caching performance and demonstrate that the proposed schemes are effective, stable, scalable and with reasonably light overhead.