A novel dynamic cache size adjustment approach for better data retrieval performance over the internet

  • Authors:

  • Allan K. Y Wong;May T. W Ip;Richard S. L Wu

  • Affiliations:

  • Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR, People's Republic of China;Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR, People's Republic of China;Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR, People's Republic of China

  • Venue:
  • Computer Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.24

Visualization

Abstract

A novel model for adaptive cache size control (MACSC) at runtime is proposed in this paper. It automatically maintains the prescribed hit ratio to guarantee the minimum expected caching performance. With this capability the system delivers better client/server communication and service response. The fringe benefit is better availability of the backbone bandwidth because caching reduces the traffic for long-haul data transfer over the Internet. The MACSC adjusts the cache size quickly, optimally and without the deleterious effect of remedying a past event spuriously regarded as a present one. The MACSC is a form of adaptive cache control within the area of cache adaptivity. It is unique and differs from other previous methods because it leverages the relative data object popularity as the only parameter in the control process, in the form of the popularity ratio. For the present MACSC research scope, the relative data object popularity profile, namely, the popularity distribution, is assumed to be bell-shaped and unimodel, but allows for a gentle mode skew. The MACSC computes the cache size adjustment from the sampled life data with the help of the point-estimate approach represented by the N-equation. The preliminary results from the verification and validation experiments unanimously confirm that the MACSC is indeed effective for automatic adaptive cache size control and economizing Internet backbone bandwidth.