SNN-cache: A practical machine learning-based caching system utilizing the inter-relationships of requests

An efficient caching algorithm needs to exploit the inter-relationships among requests. We introduce SNN, a practical machine learning-based relation analysis system, which can be used in different areas that require the analysis of relationships among sequenced data such as market basket analysis and online recommendation systems. In this paper, we present SNN-Cache that leverages SNN to utilize the inter-relationships among sequenced requests in caching decision. We evaluate SNN-Cache using an Information Centric Network (ICN) simulator, and show that it decreases the load of content servers significantly compared to a recent size-aware cache replacement algorithm (up to 30.7%) as well as the traditional cache replacement algorithms.

[1]  Anirban Mahanti,et al.  Traffic analysis of a Web proxy caching hierarchy , 2000 .

[2]  Philip S. Yu,et al.  Caching on the World Wide Web , 1999, IEEE Trans. Knowl. Data Eng..

[3]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

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

[5]  George Pavlou,et al.  Icarus: a caching simulator for information centric networking (ICN) , 2014, SimuTools.

[6]  Nikolaos Laoutaris,et al.  The LCD interconnection of LRU caches and its analysis , 2006, Perform. Evaluation.

[7]  Wael Hassan.  Simplified Wrapper and Interface Generator , 2000 .

[8]  Michael J. Freedman,et al.  Hyperbolic Caching: Flexible Caching for Web Applications , 2017, USENIX Annual Technical Conference.

[9]  Nizar R. Mabroukeh,et al.  A taxonomy of sequential pattern mining algorithms , 2010, CSUR.

[10]  Kai Li,et al.  RIPQ: Advanced Photo Caching on Flash for Facebook , 2015, FAST.

[11]  George Pavlou,et al.  Hash-routing schemes for information centric networking , 2013, ICN '13.

[12]  Peter Scheuermann,et al.  Proxy Cache Algorithms: Design, Implementation, and Performance , 1999, IEEE Trans. Knowl. Data Eng..

[13]  George Pavlou,et al.  In-Network Cache Management and Resource Allocation for Information-Centric Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[14]  Song Jiang,et al.  LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance , 2002, SIGMETRICS '02.

[15]  Steven Schmeiser.  The size distribution of websites , 2015 .

[16]  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).

[17]  Yuanyuan Zhou,et al.  The Multi-Queue Replacement Algorithm for Second Level Buffer Caches , 2001, USENIX Annual Technical Conference, General Track.

[18]  Neal E. Young,et al.  Competitive paging and dual-guided on-line weighted caching and watching algorithms , 1992 .

[19]  Nimrod Megiddo,et al.  ARC: A Self-Tuning, Low Overhead Replacement Cache , 2003, FAST.

[20]  Brad Fitzpatrick,et al.  Distributed caching with memcached , 2004 .

[21]  John Langford,et al.  A Multiworld Testing Decision Service , 2016, ArXiv.

[22]  Qiang Yang,et al.  Taylor series prediction: a cache replacement policy based on second-order trend analysis , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[23]  Alan L. Cox,et al.  GD-Wheel: a cost-aware replacement policy for key-value stores , 2015, EuroSys.

[24]  Sang Lyul Min,et al.  On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies , 1999, SIGMETRICS '99.

[25]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[26]  Dennis Shasha,et al.  2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.

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