CACHERP: a novel dynamic cache size tuning model working with relative object popularity for fast web information retrieval

Authors:
Richard S. L. Wu;Allan K. Y. Wong;Tharam S. Dillon
Affiliations:
Department of Computing, Hong Kong Polytechnic University, Hong Kong, SAR;Department of Computing, Hong Kong Polytechnic University, Hong Kong, SAR;Faculty of Information Technology, University of Technology, Sydney Broadway, N.S.W.
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 7
Cited 0

A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
Frameworks for component-based client/server computing

ACM Computing Surveys (CSUR)
Adaptive web caching: towards a new global caching architecture

Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Introduction to Simulation Modeling Using GPSS/PC

Introduction to Simulation Modeling Using GPSS/PC
Web Caching

Web Caching
Guest Editor's Introduction: Caching in Distributed Systems

IEEE Concurrency
Caching on the World Wide Web

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

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).