Advertisement

Generational replacement schemes for a WWW caching proxy server

  • Noritaka Osawa
  • Toshitsugu Yuba
  • Katsuya Hakozaki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1225)

Abstract

This paper proposes and evaluates generational replacement schemes that suit access patterns to the World Wide Web (WWW) proxy server cache. The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced. Using our schemes, the hit rate per page is improved by about 5.2 percentage points over the Least Recently Used (LRU) algorithm on the basis of logs of more than 8 million accesses. This improvement reduces the number of cache misses by about 10.8 percent with respect to LRU. Our improvement is roughly twice as good as the improvement of LRU over the First-In First-Out (FIFO) algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abrams, Marc, Charles R. Standridge, Ghaleb Abdulla, Stephen Williams and Edward A. Fox, “Caching Proxies: Limitations and Potentials,” Proc. of Fourth Int'l World Wide Web Conference, Dec. 1995.Google Scholar
  2. 2.
    Andreessen, M., “NCSA Mosaic Technical Summary,” National Center for Supercomputing Applications, 1993.Google Scholar
  3. 3.
    Bartlett, Joel F., “W4 — the Wireless World Wide Web,” Proc. of Workshop on Mobile Computing Systems and Applications, pp.176–178, Dec. 1994.Google Scholar
  4. 4.
    Berners-Lee, T., R. Fielding and H. Frystyk, “Hypertext Transfer Protocol — HTTP/1.0,” HTTP Working Group Internet-Draft, Feb. 1996.Google Scholar
  5. 5.
    Berners-Lee, T., L. Masinter and M. McCahill, “Uniform Resource Locators,” RFC 1738, Dec. 1994.Google Scholar
  6. 6.
    Danzig, P.B., R.S. Hall and M.F. Schwartz, “A case for caching file objects inside internetworks,” Proc. of ACM SIGCOMM '93, pp.239–248, Sept. 1993.Google Scholar
  7. 7.
    Glassman, Steven, “A Caching relay for the World Wide Web,” Proc. of 1st Int'l Conf. on WWW, Geneva, May 1994; also appeared in Computer Networks and ISDN Systems, Vol.27, pp.165–173, 1994.Google Scholar
  8. 8.
    Ichii, Shingo and Masaya Nakayama, “Effectiveness of WWW caching in a campus network,” IPSJ SIG Notes DSM-9505033 (in Japanese).Google Scholar
  9. 9.
    Knuth, Donald, The Art of Computer Programming, Vol. 3. Sorting and Searching, Addison-Wesley, 1973.Google Scholar
  10. 10.
    Lieberman, H. and C. Hewitt, “A Real-Time Garbage Collector Based on the Lifetimes of Objects,” Comm. ACM, Vol.26, No.6, pp.419–429, June 1983.Google Scholar
  11. 11.
    Luotonen, A. and K. Altis, “World-Wide Web Proxies,” Proc. of 1st Int'l Conf. on WWW, Geneva, May 1994; also appeared in Computer Networks and ISDN Systems, Vol.27, pp.147–154, 1994.Google Scholar
  12. 12.
    Maekawa, Mamoru, Arthur E. Oldehoeft and Rodney R. Oldehoeft, Operatings Systems Advanced Concepts, Benjamin/Cummings Pub., Menlo Park, 1987.Google Scholar
  13. 13.
    Osawa, Noritaka, Fumitaka Hayano, Toshitsugu Yuba and Katsuya Hakozaki, “Evaluation of Replacement Policies in WWW Cache Based on Logs from Proxy Server,” IPSJ SIG Notes DPS 74-33, Jan. 1996 (in Japanese).Google Scholar
  14. 14.
    Pitkow, J. E. and M. M. Recker, “A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns,” Proc. of 2nd Int'l WWW Conf., pp.1039–1046, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Noritaka Osawa
    • 1
  • Toshitsugu Yuba
    • 1
  • Katsuya Hakozaki
    • 1
  1. 1.Graduate School of Information SystemsThe University of Electro-CommunicationsJapan

Personalised recommendations