Caching under Content Freshness Constraints

12/28/2017
by   Pawan Poojary, et al.
0

Several real-time delay-sensitive applications pose varying degrees of freshness demands on the requested content. The performance of cache replacement policies that are agnostic to these demands is likely to be sub-optimal. Motivated by this concern, in this paper, we study caching policies under a request arrival process which incorporates user freshness demands. We consider the performance metric to be the steady-state cache hit probability. We first provide a universal upper bound on the performance of any caching policy. We then analytically obtain the content-wise hit-rates for the Least Popular (LP) policy and provide sufficient conditions for the asymptotic optimality of cache performance under this policy. Next, we obtain an accurate approximation for the LRU hit-rates in the regime of large content population. To this end, we map the characteristic time of a content in the LRU policy to the classical Coupon Collector's Problem and show that it sharply concentrates around its mean. Further, we develop modified versions of these policies which eject cache redundancies present in the form of stale contents. Finally, we propose a new policy which outperforms the above policies by explicitly using freshness specifications of user requests to prioritize among the cached contents. We corroborate our analytical insights with extensive simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2020

Cache Allocations for Consecutive Requests of Categorized Contents: Service Provider's Perspective

In wireless caching networks, a user generally has a concrete purpose of...
research
06/11/2021

A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies

Caching systems have long been crucial for improving the performance of ...
research
01/09/2018

Optimal Content Replication and Request Matching in Large Caching Systems

We consider models of content delivery networks in which the servers are...
research
01/01/2018

Time Aware Least Recent Used (TLRU) Cache Management Policy in ICN

The information centric networks (ICN) can be viewed as a network of cac...
research
09/21/2023

Performance Model for Similarity Caching

Similarity caching allows requests for an item to be served by a similar...
research
04/09/2018

Caching with Time Domain Buffer Sharing

In this paper, storage efficient caching based on time domain buffer sha...
research
09/09/2019

The Study of Dynamic Caching via State Transition Field – the Case of Time-Invariant Popularity

This two-part paper investigates cache replacement schemes with the obje...

Please sign up or login with your details

Forgot password? Click here to reset