Prefetching and Performance Evaluation of Web Caching Algorithms

Main Article Content

Ms. S. Latha Shanmugavadivu
Dr. M. Rajaram


Caching is a technique first used by memory management to reduce bus traffic and latency of data access. Web traffic has increased
tremendously since the beginning of the 1990s.With the significant increase of Web traffic, caching techniques are applied to Web caching to
reduce network traffic, user-perceived latency, and server load by caching the documents in local proxies. In this paper, analization of both
advantages and disadvantages of some current Web cache replacement algorithms including lowest relative value algorithm, least weighted
usage algorithm and least unified-value (LUV) algorithm is done. Based on our analysis, we proposed a new algorithm, called least grade
replacement (LGR), which takes recency, frequency, perfect-history, and document size into account for Web cache optimization. The optimal
recency coefficients were determined by using 2- and 4-way set associative caches. The cache size was varied from 32 k to 256 k in the
simulation. The simulation results showed that the new algorithm (LGR) is better than LRU and LFU in terms of hit ratio (BR) and byte hit ratio


Keywords: web caching, prefetching, LGR, LRU, LFU algorithms, parsing


Download data is not yet available.

Article Details