Cost-Aware WWW Proxy Caching Algorithms

1st USENIX Symposium on Internet Technologies and Systems, USITS 1997

Volumn , Issue , 1997, Pages

  Cao, Pei ^a   Irani, Sandy ^b  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SILICON;

GREEDYDUAL; LATENCY REDUCTION; MAIN MEMORY; NETWORK COSTS; PARAMETERIZED; PROXY CACHING ALGORITHMS; TRACE DRIVEN SIMULATION; WEB CACHE REPLACEMENTS;

COST REDUCTION;

EID: 85027199724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [Ir97] S. Irani. Page replacement with multi-size pages and applications to web caching. In the Proceedings for the 29th Symposium on the Theory of Computing, 1997, pages 701-710.
2. [LRV97] P. Lorenzetti, L. Rizzo and L. Vi-cisano. Replacement Policies for a Proxy Cache. http://www.iet.unipi.it/luigi/research.html.
3. [CBC95] Carlos R. Cunba, Azer Bestavros, Mark E. Crovella Characteristics of WWW Client-based Traces BU-CS-96-010, Boston University.
4. [LM96] Paul Leach and Je Mogul. The Hit Metering Proto col. Manuscript.
5. [HT97] IETF The HTTP 1.1 Proto col - Draft. http://www.ietf.org.
6. [ST85] D. Sleator and R. E. Tarjan. Amortized e-ciency of list up date and paging rules. Communications of the ACM, 28:202{208, 1985.
7. [Tufte] Edward Tufte The Visual Display of Quantitative Information. Graphics Printers, Feburary 1992.
8. [W3C] The Noti cation Proto col. http://www.w3c.org.
9. [WASAF96] S. Williams, M. Abrams, C.R. Standbridge, G.Ab dulla and E.A. Fox. Removal Policies in Network Caches for World-Wide Web Do cuments. In Proceedings of the ACM Sigcomm96, August, 1996, Stanford University.
10. [WA97] R. Wo oster and M. Abrams. Proxy Caching the Estimates Page Load Delays. In the 6th International World Wide Web Conference, April 7-11, 1997, Santa Clara, CA. http://www6.nttlabs.com/Hyp erNews/get/ PAPER250.html.
11. [WPB] Jussara Almeida and Pei Cao. The Wisconsin Proxy Benchmark (WPB). http://www.cs.wisc.edu/cao/wpb1.0.html.
12. [You91b] N. Young. The k-server dual and lo ose comp etitiveness for paging. Algorithmica,June 1994, vol. 11,(no.6):525-41. Rewritten version of \Online caching as cache size varies", in The 2nd Annual ACM-SIAM Symp osium on Discrete Algorithms, 241-250, 1991.
13. [ASAWF95] M. Abrams, C.R. Standbridge, G.Ab dulla, S. Williams and E.A. Fox. Caching Proxies: Limitations and Potentials. WWW-4, Boston Conference, Decemb er, 1995.
14. [Bel66] L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78{101, 1966.
15. [CD73] G. Co man, Jr., Edward and Peter J. Den-ning, Op erating Systems Theory, Prentice-Hal l, Inc. 1973.
16. [CKPV91] M. Chrobak, H. Karlo, T. H. Payne and S. Vishwanathan. New results on server problems. newblo ck SIAM Journal on Discrete Mathematics, 4:172{181, 1991.
17. [DEC96] Digital Equipment Co op eration, Digital's Web Proxy Traces ftp://ftp.digital.com/pub/DEC/traces/proxy/webtraces.html.
18. [FKIP96] A. Feldman, A. Karlin, S. Irani, S. Phillips. Private Communication.
19. [Ho97] Hosseini, Saied, Private Communication.
20. [LC97] Cheng jie Liu, Pei Cao. Maintaining Strong Cache Consistency in the World-Wide Web. In Proceedings of the 1997 International Conferences on Distributed Computing Systems, May, 1997.
21. [You97] N. Young. Online le caching. To app ear in the Proceedings for the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.