By Topic

Adaptive object cache pre-fetching scheme based on object flow

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fareed, H. ; Sun MicroSyst. Inc., Menlo Park, CA, USA ; Bassiouni, M.

In this paper, we present a Web caching and pre-fetching scheme based on the concept of object flows. The scheme maintains a weighted directed flow graph whose vertices represent the objects accessed by the users and whose edges represent the reference flow relationships between these objects. Each directed edge in the graph is weighted in proportion to the frequency of occurrence of the reference sequence represented by that edge. Edge weights are adaptively changed to capture new access patterns and a controllable threshold parameter is used to prune out weak flow relationships. The decision for object pre-fetching or pre-eviction utilizes routines to compute objects that are strongly flow-related to the accessed/evicted object. The performance of the scheme was compared with LRU using an NS.2 simulation model. Our simulation used real life Internet traces from NANLR and UCB. An Oracle database was used to store/update the reference histories and was connected to the NS simulator using OCI (Oracle Call Interface). Extensive simulation tests were conducted to compare the performance of the two algorithms in terms of hit ratio and cost of pre-fetching. The tests covered a wide range of parameter values, e.g., cache size, the threshold for strong flow relationship, and the maximum number of objects that can be pre-fetched at a time. Our simulation experiments showed that the flow-based scheme is easy to implement and achieves significant improvement over LRU.

Published in:

Performance, Computing, and Communications Conference, 2005. IPCCC 2005. 24th IEEE International

Date of Conference:

7-9 April 2005