A Least Grade Page Replacement Algorithm for Web Cache Optimization

First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008) Pub Date : 2008-01-23 DOI:10.1109/WKDD.2008.124

Naizheng Bian, Hao Chen

{"title":"A Least Grade Page Replacement Algorithm for Web Cache Optimization","authors":"Naizheng Bian, Hao Chen","doi":"10.1109/WKDD.2008.124","DOIUrl":null,"url":null,"abstract":"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 1990 s. 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, we analyzed 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. 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 (BHR).","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WKDD.2008.124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

Abstract

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 1990 s. 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, we analyzed 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. 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 (BHR).

查看原文本刊更多论文

一种用于Web缓存优化的最小级页面替换算法

缓存是内存管理首先使用的一种技术，用于减少总线流量和数据访问的延迟。自20世纪90年代初以来，网络流量急剧增长。随着Web流量的显著增加，缓存技术被应用于Web缓存，通过在本地代理中缓存文档来减少网络流量、用户感知的延迟和服务器负载。本文分析了当前几种Web缓存替换算法的优缺点，包括最小相对值算法、最小加权使用算法和最小统一值(LUV)算法。基于我们的分析，我们提出了一种新的算法，称为最小等级替换(LGR)，它将近代性、频率、完美历史记录和文档大小考虑到Web缓存优化中。使用2路和4路集合关联缓存确定最优近因系数。在模拟中，缓存大小从32 k到256 k不等。仿真结果表明，LGR算法在命中率(BR)和字节命中率(BHR)方面都优于LRU和LFU算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)

自引率

0.00%

发文量