Access-Time Aware Cache Algorithms

Most of the caching algorithms are oblivious to requests' timescale, but caching systems are capacity constrained and, in practical cases, the hit rate may be limited by the cache's impossibility to serve requests fast enough. In particular, the hard-disk access time can be the key factor capping cache performances. In this paper, we present a new cache replacement policy that takes advantage of a hierarchical caching architecture, and in particular of access-time difference between memory and disk. Our policy is optimal when requests follow the independent reference model, and significantly reduces the hard-disk load, as shown also by our realistic, trace-driven evaluation.

[1]  Alhussein A. Abouzeid,et al.  On designing optimal memory damage aware caching policies for content-centric networks , 2016, 2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[2]  Neal E. Young,et al.  Online Paging and Caching , 2008, Encyclopedia of Algorithms.

[3]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[4]  Pietro Michiardi,et al.  Cache Policies for Linear Utility Maximization , 2018, IEEE/ACM Transactions on Networking.

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

[6]  M. Draief,et al.  Placing dynamic content in caches with small population , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[7]  Spencer W. Ng,et al.  Advances in Disk Technology: Performance Issues , 1998, Computer.

[8]  Edward A. Fox,et al.  Caching Proxies: Limitations and Potentials , 1995, WWW.

[9]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[10]  Bruce M. Maggs,et al.  Algorithmic Nuggets in Content Delivery , 2015, CCRV.

[11]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[12]  Donald F. Towsley,et al.  Performance evaluation of hierarchical TTL-based cache networks , 2014, Comput. Networks.

[13]  Jeffrey Scott Vitter,et al.  Modeling and optimizing I/O throughput of multiple disks on a bus , 1999, SIGMETRICS '99.

[14]  Predrag R. Jelenkovic,et al.  Optimizing LRU Caching for Variable Document Sizes , 2004, Combinatorics, Probability and Computing.

[15]  Michele Garetto,et al.  A unified approach to the performance analysis of caching systems , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[16]  Muhammad Zubair Shafiq,et al.  Characterizing caching workload of a large commercial Content Delivery Network , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[17]  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.

[18]  Dario Rossi,et al.  Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures) , 2016, IEEE Transactions on Parallel and Distributed Systems.

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

[20]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[21]  Ronald Fagin,et al.  Asymptotic Miss Ratios over Independent References , 1977, J. Comput. Syst. Sci..

[22]  Ramesh K. Sitaraman,et al.  The Akamai network: a platform for high-performance internet applications , 2010, OPSR.

[23]  A. Bruckner,et al.  Elementary Real Analysis , 1991 .

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

[25]  Armand M. Makowski,et al.  Optimal replacement policies for nonuniform cache objects with optional eviction , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[26]  Ramesh K. Sitaraman,et al.  AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network , 2017, NSDI.

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

[28]  Pietro Michiardi,et al.  Access-Time Aware Cache Algorithms , 2016, ITC.

[29]  Giuseppe Bianchi,et al.  Check before storing: what is the performance price of content integrity verification in LRU caching? , 2013, CCRV.

[30]  Mihaela van der Schaar,et al.  Popularity-driven content caching , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[31]  David Tse,et al.  Probabilistic methods for web caching , 2001, Perform. Evaluation.

[32]  Valentino Pacifici,et al.  Coordinated Selfish Distributed Caching for Peering Content-Centric Networks , 2016, IEEE/ACM Transactions on Networking.

[33]  Dario Rossi,et al.  Multi-Terabyte and multi-Gbps information centric routers , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[34]  Paolo Giaccone,et al.  Temporal locality in today's content caching: why it matters and how to model it , 2013, CCRV.