Soft-TTL: Time-Varying Fractional Caching

07/10/2018
by   Jasper Goseling, et al.
0

Standard Time-to-Live (TTL) cache management prescribes the storage of entire files, or possibly fractions thereof, for a given amount of time after a request. As a generalization of this approach, this work proposes the storage of a time-varying, diminishing, fraction of a requested file. Accordingly, the cache progressively evicts parts of the file over an interval of time following a request. The strategy, which is referred to as soft-TTL, is justified by the fact that traffic traces are often characterized by arrival processes that display a decreasing, but non-negligible, probability of observing a request as the time elapsed since the last request increases. An optimization-based analysis of soft-TTL is presented, demonstrating the important role played by the hazard function of the inter-arrival request process, which measures the likelihood of observing a request as a function of the time since the most recent request.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2018

Wireless Video Caching and Dynamic Streaming under Differentiated Quality Requirements

This paper considers one-hop device-to-device (D2D)-assisted wireless ca...
research
01/27/2022

On the Impact of Network Delays on Time-to-Live Caching

We consider Time-to-Live (TTL) caches that tag every object in cache wit...
research
09/09/2019

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

In the second part of this two-part paper, we extend the study of dynami...
research
01/16/2020

Online Convex Optimization for Caching Networks

We study the problem of wireless edge caching when file popularity is un...
research
04/09/2018

Caching with Time Domain Buffer Sharing

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

Caching in Networks without Regret

We consider the online problem where n users are connected to m caches ...
research
12/20/2017

Network Cache Design under Stationary Requests: Challenges, Algorithms and Experiments

The design of caching algorithms to maximize hit probability has been ex...

Please sign up or login with your details

Forgot password? Click here to reset