Abstract
Document caching and connection caching are extensively studied problems. In document caching, one has to maintain caches containing documents accessible in a network. In connection caching, one has to maintain a set of open network connections that handle data transfer. Previous work investigated these two problems separately while in practice the problems occur together: In order to load a document, one has to establish a connection between network nodes if the required connection is not already open.
In this paper we present the first study that integrates document and connection caching. We first consider a very basic model in which all documents have the same size and the cost of loading a document or establishing a connection is equal to 1. We present deterministic and randomized online algorithms that achieve nearly optimal competitive ratios unless the size of the connection cache is extremely small. We then consider general settings where documents have varying sizes. We investigate a Fault model in which the loading cost of a document is 1 as well as a Bit model in which the loading cost is equal to the size of the document.
Work supported by the Deutsche Forschungsgemeinschaft, Project AL 464/3-1, and by the European Community, Projects APPOL and APPOL II. Work done while the second author was at the Institut für Informatik, Albert-Ludwigs-Universität, Freiburg, Germany.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.
S. Albers. Generalized connection caching. In Proceedings of the Twelfth ACM Symposium on Parallel Algorithms and Architectures, pages 70–78. ACM, 2000.
E. Cohen, H. Kaplan, and U. Zwick. Connection caching. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 612–621. ACM, 1999.
E. Cohen, H. Kaplan, and U. Zwick. Connection caching under various models of communication. In Proceedings of the Twelfth ACM Symposium on Parallel Algorithms and Architectures, pages 54–63. ACM, 2000.
T. Feder, R. Motwani, R. Panigraphy, and A. Zhu. Web caching with request reordering. In Proceedings 13th ACM-SIAM Symposium on Discrete Algorithms, pages 104–105, 2002.
A. Feldman, R. Karp, M. Luby, and L. A. McGeoch. Personal communication cited in [9].
A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685–699, Dec 1991.
P. Gopalan, H. Karloff, A. Mehta, M. Mihail, and N. Vishnoi. Caching with expiration times. In Proceedings 13th ACM-SIAM Symposium on Discrete Algorithms, pages 540–547, 2002.
S. Irani. Page replacement with multi-size pages and applications to web caching. In Proceedings 29th ACM Symposium on Theory of Computing, pages 701–710, 1997.
L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816–825, 1991.
D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.
N. Young. On-line file caching. In Proceedings 9th ACM-SIAM Symposium on Discrete Algorithms, pages 82–86, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S., van Stee, R. (2003). A Study of Integrated Document and Connection Caching. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_52
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive