Leveraging relative object popularity as the sole parameter for dynamic cache size tuning to shorten the information retrieval roundtrip time over the web

Authors:
Allan K. Y. Wong;Richard S. L. Wu;Wilfred W. K. Lin
Affiliations:
Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR;Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR;Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 11
Cited 0

A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes

IEEE/ACM Transactions on Networking (TON)
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
On the use of self-similar processes in network simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
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
Genetic algorithm and PID Control together for dynamic anticipative marginal buffer management: an effective approach to enhance dependability and performance for distributed mobile object-based real-time computing over the internet

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the novel model for dynamic cache size tuning: CACHERP is proposed. It is a unique model capable of maintaining the given hit ratio consistently on the fly. This model achieves its objective by leveraging the current relative popularity profile of data objects in a statistical manner. Being statistical the CACHERP operation is insensitive to the Internet traffic patterns that switch suddenly. These patterns include the LRD (long-range dependence), the SRD (short-range dependence) or the multifractals. By adaptively maintaining the given cache hit ratio the CACHERP model effectively reduces the overall information retrieval roundtrip time (RTT).