Combining request scheduling with web caching

Authors:
Tomás Feder;Rajeev Motwani;Rina Panigrahy;Steve Seiden;Rob van Stee;An Zhu
Affiliations:
Stanford University, 268 Waverley Street, Palo Alto, CA;Department of Computer Science, Stanford University, Stanford, CA;280 W. Tasman Drive, Bldg H., Cisco Systems, CA; ;Centre for Mathematics and Computer Science (CWI), P.O. Box 94079, NL-1090 GB Amsterdam, The Netherlands;Department of Computer Science, Stanford University, Stanford, CA
Venue:
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Year:
2004

Citing 6
Cited 4

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive paging algorithms

Journal of Algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms

Competitive paging and dual-guided on-line weighted caching and watching algorithms
On competitive on-line paging with lookahead

Theoretical Computer Science
The k-client problem

Journal of Algorithms
An Online Scheduling Problem with Job Set-ups

An Online Scheduling Problem with Job Set-ups

New results on web caching with request reordering

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the remote server problem or more about TCP acknowledgments

Theoretical Computer Science
Resource Management in Large Networks

Algorithmics of Large and Complex Networks
Reordering buffer management for non-uniform cost models

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 offline algorithm can reorder the requests, but not both. Finally, we extend our analysis to the case where pages have different sizes.