Caching Policies for Transient Data

This work focuses on designing caching policies for transient data, i.e., data which can be used to serve requests only for a finite duration of time after which it becomes redundant. We first characterize the fundamental limit on the performance of caching policies for transient data and characterize the performance of traditional caching policies like LRU for this setting. Traditional caching policies often make decisions based on the popularity of the data being cached. We propose a new caching policy which uses both the popularity and the residual life-time (time remaining before the data becomes redundant) to make caching decisions. We show that in the setting where data being cached is transient, our policy outperforms traditional caching policies.

[1]  Anthony Ephremides,et al.  Information freshness and popularity in mobile caching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[2]  Sharayu Moharir,et al.  Caching under Content Freshness Constraints , 2017, ArXiv.

[3]  Marian Codreanu,et al.  On the Age of Information in Status Update Systems With Packet Management , 2015, IEEE Transactions on Information Theory.

[4]  Rui L. Aguiar,et al.  A case for ICN usage in IoT environments , 2014, 2014 IEEE Global Communications Conference.

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

[6]  Roy D. Yates,et al.  Age-optimal constrained cache updating , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[7]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[8]  Rahim Tafazolli,et al.  Caching Transient Data in Internet Content Routers , 2017, IEEE/ACM Transactions on Networking.

[9]  Athanasios V. Vasilakos,et al.  Information-centric networking for the internet of things: challenges and opportunities , 2016, IEEE Network.

[10]  Rahim Tafazolli,et al.  In-network caching of Internet-of-Things data , 2014, 2014 IEEE International Conference on Communications (ICC).

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

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

[13]  Mor Harchol-Balter,et al.  Performance Modeling and Design of Computer Systems: Queueing Theory in Action , 2013 .

[14]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[15]  Antonella Molinaro,et al.  On the Performance of Caching and Forwarding in Information-Centric Networking for the IoT , 2015, WWIC.

[16]  Erol Gelenbe,et al.  A Unified Approach to the Evaluation of a Class of Replacement Algorithms , 1973, IEEE Transactions on Computers.

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