PopCache: Cache more or less based on content popularity for information-centric networking

Due to a mismatch between downloading and caching content, the network may not gain significant benefit from the sophisticated in-network caching of information-centric networking (ICN) architectures by using a basic caching mechanism. This paper aims to seek an effective caching decision policy to improve the content dissemination in ICN. We propose PopCache-a caching decision policy with respect to the content popularity-that allows an individual ICN router to cache content more or less in accordance with the popularity characteristic of the content. We propose an analytical model to evaluate the performance of different caching decision policies in terms of the server-hit rate and expected round-trip time. The analysis confirmed by simulation results shows that PopCache yields the lowest expected round-trip time compared with three benchmark caching decision policies, i.e., the always, fixed probability and path-capacity-based probability, and PopCache provides the server-hit rate comparable to the lowest ones.

[1]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[2]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[3]  Guangyu Shi,et al.  Collaborative Forwarding and Caching in Content Centric Networks , 2012, Networking.

[4]  Dario Rossi,et al.  On sizing CCN content stores by exploiting topological information , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[5]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

[6]  Thomas E. Stern,et al.  Analysis of separable Markov-modulated rate models for information-handling systems , 1991, Advances in Applied Probability.

[7]  Dario Rossi,et al.  Caching performance of content centric networks under multi-path routing (and more) , 2011 .

[8]  George Pavlou,et al.  Cache "Less for More" in Information-Centric Networks , 2012, Networking.

[9]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[10]  Dario Rossi,et al.  Large scale simulation of CCN networks , 2012 .

[11]  Dario Rossi,et al.  A dive into the caching performance of Content Centric Networking , 2012, 2012 IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD).

[12]  Massimo Gallo,et al.  Modeling data transfer in content-centric networking ( extended version ) , 2011 .

[13]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[14]  Gwendal Simon,et al.  Time-Shifted TV in Content Centric Networks: The Case for Cooperative In-Network Caching , 2011, 2011 IEEE International Conference on Communications (ICC).

[15]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[16]  Massimo Gallo,et al.  Bandwidth and storage sharing performance in information centric networking , 2011, ICN '11.

[17]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[18]  Yong-Yeol Ahn,et al.  Analyzing the Video Popularity Characteristics of Large-Scale User Generated Content Systems , 2009, IEEE/ACM Transactions on Networking.

[19]  Sasu Tarkoma,et al.  Publish/Subscribe for Internet: PSIRP Perspective , 2010, Future Internet Assembly.

[20]  PodlipnigStefan,et al.  A survey of Web cache replacement strategies , 2003 .

[21]  George Pavlou,et al.  Probabilistic in-network caching for information-centric networks , 2012, ICN '12.

[22]  Bengt Ahlgren,et al.  Secure Naming for a Network of Information , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[23]  Abdolreza Abhari,et al.  Workload generation for YouTube , 2009, Multimedia Tools and Applications.