New Results on Web Caching with Request Reordering

作者：Albers Susanne^*

来源：Algorithmica, 2010, 58(2): 461-477.

DOI：10.1007/s00453-008-9276-x

• Caching
• Online algorithms
• Approximation algorithms

We study web caching with request reordering. The goal is to maintain a cache of web documents so that a sequence of requests can be served at low cost. To improve cache hit rates, a limited reordering of requests is allowed. Feder et al. (Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 104-105, 2002), who recently introduced this problem, considered caches of size 1, i.e. a cache can store one They presented an offline algorithm based on dynamic programming as well as online algorithms that achieve constant factor competitive ratios. For arbitrary cache sizes, Feder et al. (Theor. Comput. Sci. 324:201-218, 2004) gave online strategies that have nearly optimal competitive ratios in several cost models.
In this paper we first present a deterministic online algorithm that achieves an optimal competitiveness, for the most general cost model and all cache sizes. We then investigate the offline problem, which is NP-hard in general. We develop the first polynomial time algorithms that can manage arbitrary cache sizes. Our strategies achieve small constant factor approximation ratios. The algorithms are based on a general technique that reduces web caching with request reordering to a problem of computing batched service schedules. Our approximation result for the Fault Model also improves upon the best previous approximation guarantee known for web caching without request reordering. We remark that, unlike Feder et al., we assume that bypassing is allowed, i.e. referenced documents do not necessarily have to be brought into cache to serve their requests.

• 出版日期2010-10