Combining request scheduling with web caching

@article{Feder2004CombiningRS,
  title={Combining request scheduling with web caching},
  author={Tom{\'a}s Feder and Rajeev Motwani and Rina Panigrahy and Steven S. Seiden and Rob van Stee and An Zhu},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={324},
  pages={201-218}
}
We extend the classic paging model by allowing reordering of requests under the constraint that a request is delayed by no longer than a predetermined number of time steps. We first give a dynamic programming algorithm to solve the offline case. Then we give tight bounds on competitive ratios for the online case. For caches of size k, we obtain bounds of k + O(1) for deterministic algorithms and Θ(log k) for randomized algorithms. We also give bounds for the case where either the online or the… CONTINUE READING