Randomized competitive algorithms for generalized caching

We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence of pages, the goal is to minimize the total cost of fetching the pages into the cache. We give an online algorithm with competitive ratio O(log2k), which is the first algorithm for the problem with competitive ratio sublinear in k. We also give improved O(log k)-competitive algorithms for the special cases of the Bit Model and Fault model. In the Bit Model, the fetching cost is proportional to the size of the page and in the Fault model all fetching costs are uniform. Previously, an O(log2 k)-competitive algorithm due to Irani [14] was known for both of these models. Our algorithms are based on an extension of the primal-dual framework for online algorithms which was developed by Buchbinder and Naor [7]. We first generate an O(log k)-competitive fractional algorithm for the problem. This is done by using a strengthened LP formulation with knapsack-cover constraints, where exponentially many constraints are added upon arrival of a new request. Second, we round online the fractional solution and obtain a randomized online algorithm. Our techniques provide a unified framework for caching algorithms and are substantially simpler than those previously used.

[1]  Neal E. Young,et al.  On-line caching as cache size varies , 1991, SODA '91.

[2]  Sandy Irani,et al.  Randomized Weighted Caching with Two Page Weights , 2002, Algorithmica.

[3]  Haim Kaplan.  LP-based analysis of greedy-dual-size , 1999, SODA '99.

[4]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[5]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[6]  Sanjeev Khanna,et al.  Page replacement for general caching problems , 1999, SODA '99.

[7]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[8]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[9]  Lyle A. McGeoch,et al.  A strongly competitive randomized paging algorithm , 1991, Algorithmica.

[10]  Neal Young,et al.  The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[11]  Sandy Irani,et al.  Page replacement with multi-size pages and applications to Web caching , 1997, STOC '97.

[12]  Jochen Könemann,et al.  On Column-Restricted and Priority Covering Integer Programs , 2010, IPCO.

[13]  Sandy Irani,et al.  Competitive Analysis of Paging: A Survey , 1998 .

[14]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[15]  Marek Chrobak,et al.  Competitive analysis of randomized paging algorithms , 2000, Theor. Comput. Sci..

[16]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[17]  Neal E. Young,et al.  On-Line File Caching , 2002, SODA '98.

[18]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[19]  Marek Chrobak,et al.  New results on server problems , 1991, SODA '90.

[20]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[21]  Dror Rawitz,et al.  On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique , 2001, RANDOM-APPROX.