The CACHERPframework leverages the relative object popularity as the sole parameter for dynamic cache size tuning. In the process it consistently maintains the prescribed cache hit ratio on the fly by deriving the popularity ratio from the current statistics. As a result the accuracy of the statistical CACHERPoperation is independent of changes in the Internet traffic pattern that may switch suddenly. The contribution by the novel CACHERPframework is that by adaptively maintaining the given hit ratio it effectively reduces the end-to-end information retrieval roundtrip time (RTT) and frees more bandwidth for sharing. This bandwidth would otherwise be consumed in transferring large amounts of data from remote data sources to the proxy server before it is given to the client or requestor.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Lewandowski SM (1998) Frameworks for Component-Based Client Server Computing. ACM Computer Survey 30(1):3–27
Molnar S, Dang TD, Vidacs A (1999) Heavy-Tailedness, Long-Range Dependence and Self-Similarity in Data Traffic. Proc. of the 7th Int&l Conference on Telecommunication Systems, Modelling and Analysis, Nashville, USA, pp 18–21
Willinger W, Paxson V, Riedi RH, Taqqu MS (2002) Long-Range Dependence and data network traffic. Long Range Dependence: Theory and Applications, Birkhauser, pp 373–408
Aggarwal C, Wolf JL, Yu PS (1999) Caching on the World Wide Web. IEEE transactions on knowledge and data Engineering, 11(1):94–107
Glassman S (1994) A caching relay for the World Wide Web. Proc. of the 1st International Conference on the World Wide Web, Geneva, Switzerland
Milutinovic V (2000) Caching in distributed systems. IEEE Concurrency 8(3):14–15
Breslau L, Cao P, Fan L, Philips G, Shenker S (1999) Web caching and zipf-like distributions: Evidence and implications. Proc. of INFOCOM&99, pp 126–134
Yu PS, MacNair EA (1998) Performance study of collaborative method for hierarchical caching in Proxy servers. Computer Networks 30(1–7):215–224
Michel S, Nguyen K, Rosenstein A, Zhang L (1998) Adaptive web caching: Towards a new caching architecture. Computer Networks 30(22–23):2709–2282
Wu RSL, Wong AKY, Dillon TS (2004) 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
Kroeger TM, Mogul J, Maltzahn C (1996) Digital&s web proxy traces, http://gatekeeper.dec.com/pub/DEC/traces/proxy/webtraces.html
Gribble S, Brewer E (1997) UCB home IP HTTP traces, http://www.cs.berkeley.edu/gribble/traces/index.html
Nishikawa N, Hosokawa T, Mori Y, Yoshida, K, Tsuji H (1998) Memory-based architecture for distributed WWW caching proxy. Proc. of the 7th WWW Conference, pp. 205–214
Almeida V et al (1998) Analyzing the behavior of a proxy server in the light of regional and cultural issues. Proc. of the WCW
Chisman JA (1992) Introduction to simulation and modeling using GPSSPC. Prentice Hall, New Jersey
Wessels D (2001) Web caching. O&Reilly & Associates Inc
The Internet Traffic Archive, ACM SIGCOMM Special Interest Group on Data Communications, http://ita.ee.lbl.gov/index.html
Mitsuru O, Guenter K, Kouichi O (1998) IBM Aglets Specification 1.1 Draft, http://www.trl.ibm.com/aglets/spec11.htm
About this article
Cite this article
Wu, R.S.L., Wong, A.K.Y. & Dillon, T.S. CACHE RP : A novel dynamic cache size tuning model working with relative object popularity for fast web information retrieval. J Supercomput 36, 283–296 (2006). https://doi.org/10.1007/s11227-006-8298-x
- Dynamic cache size tuning
- Popularity ratio
- Information retrieval