.png){kind=icon}
.png){kind=icon}
Return
An Improved Web Cache Replacement Algorithm Based on Weighting and Cost
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2829142.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cache memory plays an important role in improving the performance of web servers, especially for big data transmission, which response time is constrained. It is necessary to use an effective method, such as web cache. Because an outstanding cache replacement algorithm can not only reduce the users access time but also improve the performance of the system. The traditional used weighting replacement policy does not consider the size parameter, hence, it may perform poorly while the datasets are larger. In this paper, we propose a novel, high-performance cache replacement algorithm for the web cache, named weighting size and cost replacement policy (WSCRP) bases on the weighting replacement policy. The algorithm recalculates the objects weight with adding the cost attribute in the cache, then orders the weight. Additionally the influence of various factors on the Web object as frequency, time, and cost value are considered. When the cache space cannot satisfy the new request object, the replacement policy WSCRP replaces the largest weighting and cost object. The experiments show that proposed algorithm has higher hit rate and byte rate for different datasets, and can effectively improve the performance of web cache.
Keywords:
Web cache
replacement
weighting
cost
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W