Flexible Content Placement in Cache Networks using Reinforced Counters

In this paper we study the problem of content placement in a ca che network. We consider a network where routing of requests is b ased on random walks. Content placement is done using a novel mechanism ref erred to as "rein- forced counters". To each content we associate a counter, wh ich is incremented every time the content is requested, and which is decremente d at a fixed rate. We model and analyse this mechanism, tuning its parameters s o as to achieve desired performance goals for a single cache or for a cache ne twork. We also show that the optimal static content placement, without rei nforced counters, is NP hard under different design goals.

[1]  Daniel Sadoc Menasché,et al.  Enabling Information Centric Networks through Opportunistic Search, Routing and Caching , 2013, ArXiv.

[2]  P. Couvares.  Caching in the Sprite network file system , 2006 .

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

[4]  Giuseppe Bianchi,et al.  A General, Tractable and Accurate Model for a Cascade of LRU Caches , 2014, IEEE Communications Letters.

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

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

[7]  Luiz Satoru Ochi,et al.  A new hybrid heuristic for replica placement and request distribution in content distribution networks , 2015, Optim. Lett..

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

[9]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[11]  Benny Van Houdt,et al.  Transient and steady-state regime of a family of list-based cache replacement algorithms , 2015, Queueing Systems.

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

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

[14]  Giuseppe Bianchi,et al.  A General, Tractable and Accurate Model for a Cascade of Caches , 2013, ArXiv.

[15]  Ronald Fagin,et al.  Efficient Calculation of Expected Miss Ratios in the Independent Reference Model , 1978, SIAM J. Comput..