Randomized competitive algorithms for generalized caching

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 235-244

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Naor, Joseph ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS;

CACHING ALGORITHM; COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; FRACTIONAL SOLUTIONS; LP FORMULATIONS; ON-LINE ALGORITHMS; PRIMAL-DUAL; UNIFIED FRAMEWORK;

COMPUTATION THEORY;

EID: 57049106945     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374412     Document Type: Conference Paper

References (20)

1. D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1-2):203-218, 2000.
2. S. Albers, S. Arora, and S. Khanna. Page replacement for general caching problems. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 31-40, 1999.
3. N. Bansal, N. Buchbinder, and J. Naor. A primal-dual randomized algorithm for weighted paging. In Proc. of the 4 8th annual IEEE Symposium on Foundations of Computer Science, pages 507-517, 2007.
4. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. J. ACM, 48(5): 1069-1090, 2001.
5. Reuven Bar-Yehuda, and Dror Rawitz. On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Discrete Math., 19(3):762-797, 2005.
6. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
7. N. Buchbinder and J. Naor. Online primal-dual algorithms for covering and packing problems. In Proceedings of the 13th Annual European Symposium on Algorithms, pages 689-701, 2005.
8. P. Cao and S. Irani. Cost-aware www proxy caching algorithms. In USENIX Symposium on Internet Technologies and Systems, pages 193-206, 1997.
9. R. Carr, L. Fleischer, V. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Symposium on Discrete Algorithms, pages 106-115, 2000.
10. M. Chrobak, H. J. Karloff, T. H. Payne, and S. Vishwanathan, New results on server problems. SIAM J. Discrete Math, 4(2):172-181, 1991.
11. E. Cohen and H. Kaplan. LP-based analysis of greedy-dual-size. In Proceedings of the 10th Annual ACM-SIAM symposium on Discrete algorithms, pages 879-880, 1999.
12. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Competitive paging algorithms. J. Algorithms, 12(4):685-699, 1991.
13. S. Irani. Competitive analysis of paging: a survey. In Proceedings of the Workshop on Online Algorithms, Dagstuhl, Germany. Springer Verlag Lecture Notes in Computer Science.
14. S. Irani. Page replacement wath multi-size pages and applications to web caching. In Proceedings of the 29th Annual ACM Symposium on Theory of computing, pages 701-710, 1997.
15. S. Irani. Randomized weighted caching with two page weights. Algorithmica, 32(4):624-640, 2002.
16. L. A. McGeoch and D. D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6(6):816-825, 1991.
17. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
18. N. E. Young. On-line caching as cache size varies. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 241-250, 1991.
19. N. E. Young. The κ-server dual and loose competitiveness for paging. Algorithmica, 11(6):525-541, 1994.
20. N. E. Young. On-line file caching. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 82-86, 1998.