Skip to main content

CACHERP: A Novel Dynamic Cache Size Tuning Model Working with Relative Object Popularity for Fast Web Information Retrieval

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3358))

  • 688 Accesses

Abstract

The novel CACHERP model for dynamic cache size tuning leverages the relative object popularity as the sole parameter. It is capable of maintaining the given hit ratio on the fly by deriving the popularity ratio from the currently collected statistics. Being statistical the accuracy of the CACHERP operation should be independent of the changes in the Internet traffic pattern, which can switch suddenly. By adaptively maintaining the given hit ratio through cache size auto-tuning in a dynamic manner the model effectively reduces the end-to-end information retrieval roundtrip time (RTT).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, C., Wolf, J.L., Yu, P.S.: Caching on the World Wide Web. IEEE Transactions on Knowledge and Data Engineering 11(1) (1999)

    Google Scholar 

  2. Mitsuru, O., Guenter, K.: IBM Aglets Spec, http://www.trl.ibm.com/aglets/spec11.htm

  3. Breslau, L., et al.: Web Caching and Zipf-like Distributions: Evidence and Implications. In: Proc. of Infocom 1999 (April 1999)

    Google Scholar 

  4. Chisman, J.A.: Introduction to Simulation and Modeling Using GPSS/PC. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

  5. Glassman, S.: A Caching Relay for the World Wide Web. In: Proc. of the 1st International Conference on the World Wide Web, Geneva, Switzerland (May 1994)

    Google Scholar 

  6. Lewandowski, S.M.: Frameworks for Component-Based Client/Server Computing. In: ACM Computer Survey, March 3–27 (1998)

    Google Scholar 

  7. Michel, S., et al.: Adaptive Web Caching: Towards a New Caching Architecture. Computer Network and ISDN Systems (November 1998)

    Google Scholar 

  8. Milutinovic, V.: Caching in Distributed Systems. IEEE Concurrency 8(3) (July-September 2000)

    Google Scholar 

  9. Wessels, D.: Web Caching, O’Reilly & Associates Inc. (2001)

    Google Scholar 

  10. Wu, K.-l., Yu, P.S.: Latency-Sensitive Hashing for Collaborative Web Caching, IBM Research Report RC21672 (February 2000)

    Google Scholar 

  11. Wu, R.S.L., Wong, A.K.Y., Dillon, T.S.: E-MACS: A Novel Dynamic Cache Tuning Technique to Maintain the Prescribed Minimum Hit Ratio Consistently for Internet/www Application. WSEAS Transactions on Computers 2(3), 430–434 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, R.S.L., Wong, A.K.Y., Dillon, T.S. (2004). CACHERP: A Novel Dynamic Cache Size Tuning Model Working with Relative Object Popularity for Fast Web Information Retrieval. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics