Amortized efficiency of list update and paging rules
Communications of the ACM
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Journal of Algorithms
Caching in large-scale distributed file systems
Caching in large-scale distributed file systems
Randomized algorithms
Approximation algorithms for NP-hard problems
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
DynaMat: a dynamic view management system for data warehouses
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
Generalized connection caching
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Client Data Caching: A Foundation for High Performance Object Database Systems
Client Data Caching: A Foundation for High Performance Object Database Systems
Client-Server Caching with Expiration Timestamps
Distributed and Parallel Databases
Database Performance for Next Generation Telecommunications
Proceedings of the 17th International Conference on Data Engineering
Proactive Caching of DNS Records: Addressing a Performance Bottleneck
SAINT '01 Proceedings of the 2001 Symposium on Applications and the Internet (SAINT 2001)
Maintaining Strong Cache Consistency in the World-Wide Web
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
The age penalty and its effect on cache performance
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
World-wide web cache consistency
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A study of integrated document and connection caching
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
Caching data together with expiration times beyond which the data is no longer valid is a standard method for promoting information consistency in distributed systems, including the Internet and WWW, large databases, and mobile telecommunications. We use the framework of competitive analysis of online algorithms and study page eviction strategies in the case where data has expiration times. We show that suitable adaptations of LRU and its generalizations, namely marking algorithms, are asymptotically optimal and, in the worst case, within a multiplicative factor 2 of the lower bounds. A key technical ingredient of our analysis is a covering invariant that captures some of the subtleties introduced by expiration times. The additional difficulty of dealing with expiration times is also reflected in our analysis of the randomized online marking algorithm, as well as the offline version of the problem for which we obtain a factor 3 approximation. We complement our theoretical findings with experiments on real and synthetic data.