LRU based small latency first replacement (SLFR) algorithm for the proxy cache

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. 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. LRU-SLFR algorithm is an extension of LRU policy with real network latency and access-count. We make the linked-list as the LRU policy and make groups by our algorithms. If proxy must replace a certain document, proxy that uses our algorithm replaces the document that takes the smallest time to load in the same conditional group window.