Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of 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
Maintaining Strong Cache Consistency in the World Wide Web
IEEE Transactions on Computers
Online computation and competitive analysis
Online computation and competitive analysis
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
World-wide web cache consistency
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Caching Content under Digital Rights Management
Approximation and Online Algorithms
| Hi-index | 5.23 |
We consider a paging problem in which each page is assigned an expiration time at the time it is brought into the cache. The expiration time indicates the latest time that the fetched copy of the page may be used. Requests that occur later than the expiration time must be satisfied by bringing a new copy of the page into the cache. The problem has applications in caching of documents on the World Wide Web (WWW). We show that a natural extension of the well-studied least recently used (LRU) paging algorithm is strongly competitive for the uniform retrieval cost, uniform size case. We then describe a similar extension of the recently proposed Landlord algorithm for the case of arbitrary retrieval costs and sizes, and prove that it is strongly competitive. The results extend to the loose model of competitiveness as well. Copyright 2001 Elsevier Science B.V.