A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
LRU based small latency first replacement (SLFR) algorithm for the proxy cache
Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)
Today, many replacement algorithms have been proposed to improve the performance of Web caching. Most suggested algorithms replace documents through calculating the network cost by several parameters. These algorithms require many parameters and need a long time to select the document for replacement. In this paper, we introduce new algorithm, called LRU based Small Latency First Replacement (LRU-SLFR), which combines LRU policy with real latency to achieve the best overall performance.
doi:10.1109/wi.2003.1241250
dblp:conf/webi/ShinKJ03
fatcat:x5vap55skzefff2hzsp4fmhk64