Abstract
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 document. 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.
Similar content being viewed by others
References
Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234, 203–218 (2000)
Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th Annual ACM–SIAM Symposium Discrete Algorithms , pp. 31–40 (1999)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48, 1069–1090 (2001)
Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78–101 (1966)
Brehob, M., Enbody, R., Torng, E., Wagner, S.: On-line restricted caching. J. Sched. 6, 149–166 (2003)
Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: Proc. USENIX Symposium on Internet Technology and Systems , pp. 193–206 (1997)
Feder, T., Motwani, R., Panigrahy, R., Zhu, A.: Web caching with request reordering. In: Proc. 13th ACM–SIAM Symposium on Discrete Algorithms, pp. 104–105 (2002)
Feder, T., Motwani, R., Panigrahy, R., Seiden, S., van Stee, R., Zhu, A.: Combining request scheduling with web caching. Theor. Comput. Sci. 324, 201–218 (2004). Extended version of [7]
Feldmann, A., Karlin, A., Irani, S., Phillips, S.: Private communication (1996). Transmitted through [12]
Fiat, A., Karp, R.M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. J. Algorithms 12, 685–699 (1991)
Gopalan, P., Karloff, H.J., Mehta, A., Mihail, M., Vishnoi, N.: Caching with expiration times. In: Proc. 13th ACM–SIAM Symposium on Discrete Algorithms, pp. 540–547 (2002)
Irani, S.: Page replacement with multi-size pages and applications to web caching. Algorithmica 33, 384–409 (2002)
McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)
Young, N.E.: Online file caching. In: Proc. 9th Annual ACM–SIAM Symposium on Discrete Algorithms , pp. 82–86 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared at the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2004.
Work supported by the Deutsche Forschungsgemeinschaft, projects AL 464/4-1 and 4-2, and by the EU, projects APPOL and APPOL II.
Rights and permissions
About this article
Cite this article
Albers, S. New Results on Web Caching with Request Reordering. Algorithmica 58, 461–477 (2010). https://doi.org/10.1007/s00453-008-9276-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9276-x