Modeling and Performance Comparison of Caching Strategies for Popular Contents in Internet

The paper is devoted to caching of popular multimedia and Web contents in Internet. We study the Cluster Caching Rule (CCR) recently proposed by the authors. It is based on the idea to store only popular contents arising in clusters of related popularity processes. Such clusters defined as consecutive exceedances of popularity indices over a high threshold are caused by dependence in the inter-request times of the objects and, hence, their related popularity processes. We compare CCR with the well-known Time-To-Live (TTL) and Least-Recently-Used (LRU) caching schemes. We model the request process for objects as a mixture of Poisson and Markov processes with a heavy-tailed noise. We focus on the hit probability as a main characteristic of a caching rule and introduce cache effectiveness as a new metric. Then the dependence of the hit probability on the cache size is studied by simulation.

[1]  M. R. Leadbetter,et al.  Extremes and Related Properties of Random Sequences and Processes: Springer Series in Statistics , 1983 .

[2]  Donald F. Towsley,et al.  A utility optimization approach to network cache design , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[3]  Donald F. Towsley,et al.  Analysis of TTL-based cache networks , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[4]  Udo R. Krieger,et al.  A Caching policy driven by clusters of high popularity , 2016, 2016 International Wireless Communications and Mobile Computing Conference (IWCMC).

[5]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Johan Segers,et al.  Inference for clusters of extreme values , 2003 .

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

[8]  N. Markovich.  A Cluster Caching Rule in Next Generation Networks , 2015 .

[9]  Sang Lyul Min,et al.  LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies , 2001, IEEE Trans. Computers.

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

[11]  Florin Ciucu,et al.  Exact analysis of TTL cache networks: the case of caching policies driven by stopping times , 2014, SIGMETRICS '14.

[12]  Predrag R. Jelenkovic,et al.  The persistent-access-caching algorithm , 2008 .

[13]  Predrag R. Jelenkovic,et al.  Asymptotic optimality of the static frequency caching in the presence of correlated requests , 2009, Oper. Res. Lett..

[14]  Claus Pahl,et al.  Containers and Clusters for Edge Cloud Architectures -- A Technology Review , 2015, 2015 3rd International Conference on Future Internet of Things and Cloud.

[15]  Luigi Rizzo,et al.  Replacement policies for a proxy cache , 2000, TNET.

[16]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

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

[18]  Natalia M. Markovich,et al.  Modeling clusters of extreme values , 2014 .

[19]  Takayuki Osogami,et al.  A fluid limit for a cache algorithm with general request processes , 2010, Advances in Applied Probability.