Caching with Time Windows and Delays

TL;DR

This paper introduces improved online algorithms with logarithmic competitiveness for generalized caching problems involving time windows and delays, and provides the first offline approximation algorithms and hardness results.

Contribution

It presents the first $O(rac{ ext{log} k ext{ log} n)}$-competitive algorithms for PageTW and PageD, and the first offline $O(1)$-approximation and APX-hardness results.

Findings

Achieved $O( ext{log} k ext{ log} n)$-competitive algorithms for online PageTW and PageD.

Developed $O(1)$-approximation algorithms for offline PageTW and PageD.

Proved APX-hardness for offline PageTW and PageD.

Abstract

We consider two generalizations of the classical weighted paging problem that incorporate the notion of delayed service of page requests. The first is the (weighted) Paging with Time Windows (PageTW) problem, which is like the classical weighted paging problem except that each page request only needs to be served before a given deadline. This problem arises in many practical applications of online caching, such as the "deadline" I/O scheduler in the Linux kernel and video-on-demand streaming. The second, and more general, problem is the (weighted) Paging with Delay (PageD) problem, where the delay in serving a page request results in a penalty being assessed to the objective. This problem generalizes the caching problem to allow delayed service, a line of work that has recently gained traction in online algorithms (e.g., Emek et al. STOC '16, Azar et al. STOC '17, Azar and Touitou FOCS '19). We give $O(\log k\log n)$-competitive algorithms for both the PageTW and PageD problems on $n$ pages with a cache of size $k$. This significantly improves on the previous best bounds of $O(k)$ for both problems (Azar et al. STOC '17). We also consider the offline PageTW and PageD problems, for which we give $O(1)$ approximation algorithms and prove APX-hardness. These are the first results for the offline problems; even NP-hardness was not known before our work. At the heart of our algorithms is a novel "hitting-set" LP relaxation of the PageTW problem that overcomes the $\Omega(k)$ integrality gap of the natural LP for the problem. To the best of our knowledge, this is the first example of an LP-based algorithm for an online algorithm with delays/deadlines.