Calculating lower bounds for caching problems

L. Epstein, R. Van Stee

Research output: Contribution to journalArticlepeer-review


We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For weighted caching, we increase the interval of weights where FIFO is known to be optimal. For companion caching, we give much simpler proofs for several known results, and give a new bound for the case of three types without reorganization or bypassing.

Original languageEnglish
Pages (from-to)275-285
Number of pages11
JournalComputing (Vienna/New York)
Issue number3
StatePublished - Jul 2007


  • Caching
  • On-line
  • Paging

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Calculating lower bounds for caching problems'. Together they form a unique fingerprint.

Cite this