Online hierarchical cooperative caching

Theory of Computing Systems

Volumn 39, Issue 6, 2006, Pages 851-874

  Li, Xiaozhou ^a   Plaxton, C Greg ^b   Tiwari, Mitul ^b   Venkataramani, Arun ^c  

^a Microsoft Digital Anvil   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ANALYSIS; COOPERATIVE CACHING; DETERMINISTIC ALGORITHMS; HIERARCHICAL GENERALIZATIONS; LEAST RECENTLY USED; OBLIVIOUS ADVERSARIES; OFF-LINE ALGORITHM; UPPER AND LOWER BOUNDS;

ALGORITHMS;

CACHE MEMORY;

EID: 33845332066     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1250-x     Document Type: Conference Paper

References (16)

1. T. E. Anderson, M. D. Dahlin, J. N. Neefe, D. A. Patterson, D. S. Rosselli, and R. Y. Wang. Serverless network file systems. In Proceedings of the 15th Symposium on Operating Systems Principles, pages 109-126, 1995.
2. B. Awerbuch, Y. Bartal, and A. Fiat. Distributed paging for general networks. Journal of Algorithms, 28:67-104, July 1998.
3. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, October 1996.
4. Y. Bartal. Distributed paging. In A. Fiat and G. J. Woeginger, editors, The 1996 Dagstuhl Workshop on Online Algorithms, volume 1442 of Lecture Notes in Computer Science, pages 97-117. Springer, Berlin, 1998.
5. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30rA Annual ACM Symposium on Theory of Computing, pages 161-168, May 1998.
6. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998.
7. C. M. Bowman, P. B. Danzig, D. R. Hardy, U. Manber, and M. F. Schwartz. The Harvest information discovery and access system. Computer Networks and ISDN Systems, 28:119-125, 1995.
8. A. Chankhunthod, P. B. Danzig, C. Neerdaels, M. F. Schwartz, and K. J. Worrell. A hierarchical internet object cache. In USENIX Annual Technical Conference, pages 153-164, 1996.
9. M. D. Dahlin, R. Y. Wang, T. E. Anderson, and D. A. Patterson. Cooperative caching: using remote client memory to improve file system performance. In Proceedings of the First Symposium on Operating Systems Design and Implementation, pages 267-280, November 1994.
10. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, June 2003.
11. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Journal of Algorithms, 38:260-302, January 2001.
12. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
13. D. Wessels. Squid Internet object cache. Available at URL http://squid.nlanr.net/squid, January 1998.
14. D. Wessels and K. Claffy. RFC 2187: Application of Internet Cache Protocol, 1997.
15. N. E. Young. On-line file caching. Algorithmica, 33:371-383, 2002.
16. L. Zhang, S. Floyd, and V. Jacobson. Adaptive web caching. In Proceedings of the 1997 NLANR Web Cache Workshop, 1997.