Temporal locality in today's content caching: why it matters and how to model it

The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of \youtube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being sufficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.

[1]  Virgílio A. F. Almeida,et al.  On the intrinsic locality properties of Web reference streams , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[3]  James F. Kurose,et al.  On the steady-state of cache networks , 2013, 2013 Proceedings IEEE INFOCOM.

[4]  Feng Qian,et al.  Web caching on smartphones: ideal vs. reality , 2012, MobiSys '12.

[5]  Dario Rossi,et al.  Experiences of Internet traffic monitoring with tstat , 2011, IEEE Network.

[6]  Didier Sornette,et al.  Robust dynamic classes revealed by measuring the response function of a social system , 2008, Proceedings of the National Academy of Sciences.

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

[8]  Paolo Giaccone,et al.  Analyzing the Performance of LRU Caches under Non-Stationary Traffic Patterns , 2013, ArXiv.

[9]  Stratis Ioannidis,et al.  Orchestrating massively distributed CDNs , 2012, CoNEXT '12.

[10]  Saverio Niccolini,et al.  A peek into the future: predicting the evolution of popularity in user generated content , 2013, WSDM.

[11]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[12]  Anja Feldmann,et al.  Enabling content-aware traffic engineering , 2012, CCRV.

[13]  Dan Pei,et al.  WWW 2009 MADRID! Track: Performance, Scalability and Availability / Session: Performance Network-Aware Forward Caching , 2022 .

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

[15]  Dan Pei,et al.  To Cache or Not to Cache: The 3G Case , 2011, IEEE Internet Computing.

[16]  Henrik Abrahamsson,et al.  Program popularity and viewer behaviour in a large TV-on-demand system , 2012, Internet Measurement Conference.

[17]  Armand M. Makowski,et al.  The output of a cache under the independent reference model: where did the locality of reference go? , 2004, SIGMETRICS '04/Performance '04.

[18]  Ana Radovanovi,et al.  Least-recently-used caching with dependent requests , 2003 .

[19]  Virgílio A. F. Almeida,et al.  Characterizing reference locality in the WWW , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[20]  K. Kyläkoski,et al.  Cache Replacement Algorithms for the Renewal Arrival Model , 1998 .

[21]  George Kollios,et al.  The Cache Inference Problem and its Application to Content and Request Routing , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[22]  Krishna P. Gummadi,et al.  A measurement-driven analysis of information propagation in the flickr social network , 2009, WWW '09.

[23]  Daniel C. Kilper,et al.  Toward energy-efficient content dissemination , 2011, IEEE Network.

[24]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[25]  Virgílio A. F. Almeida,et al.  On the intrinsic locality of web reference streams , 2003, INFOCOM 2003.

[26]  Predrag R. Jelenkovic,et al.  The persistent-access-caching algorithm , 2008, Random Struct. Algorithms.

[27]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[28]  Anja Feldmann,et al.  Revisiting Cacheability in Times of User Generated Content , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[29]  Azer Bestavros,et al.  Sources and characteristics of Web temporal locality , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[30]  Predrag R. Jelenkovic,et al.  Least-recently-used caching with dependent requests , 2004, Theor. Comput. Sci..

[31]  Philippe Robert,et al.  Impact of traffic mix on caching performance in a content-centric network , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[32]  J. Møller,et al.  Shot noise Cox processes , 2003, Advances in Applied Probability.

[33]  Christos Faloutsos,et al.  Rise and fall patterns of information diffusion: model and implications , 2012, KDD.

[34]  Jure Leskovec,et al.  Patterns of temporal variation in online media , 2011, WSDM '11.