Weighted Greedy Dual Size Frequency Based Caching Replacement Algorithm

Caches are used to improve the performance of the internet, and to reduce the latency of data access time and the low speed of repeated computing processes. Cache replacement is one of the most important issues in a caching system; therefore, it must be coordinated with the caching system to minimize the access latency and maximize the hit rate or byte hit rate. In this paper, we presented a novel caching replacement algorithm named Weighted Greedy Dual Size Frequency (WGDSF) algorithm, which is an improvement on the Greedy Dual Size Frequency (GDSF) algorithm. The WGDSF algorithm mainly adds weighted frequency-based time and weighted document type to GDSF. By increasing the above two weighted parameters, WGDSF performs fairly well at keeping popular objects in the cache and replacing rarely used ones. Our experiment shows that this algorithm has a better hit rate, byte hit rate and access latency than state-of-the-art algorithms, such least Recently Used, least Frequently Used, and GDSF.

[1]  Wang Xu-fa.  Limited History Based Multi-LRU Web Cache Replacement Algorithm , 2008 .

[2]  Manel Guerrero Zapata,et al.  An ANFIS-based cache replacement method for mitigating cache pollution attacks in Named Data Networking , 2015, Comput. Networks.

[3]  Yao Wang,et al.  LED: A fast overlapping communities detection algorithm based on structural clustering , 2016, Neurocomputing.

[4]  Madhu Mutyam,et al.  An Application-Aware Cache Replacement Policy for Last-Level Caches , 2013, ARCS.

[5]  Ahmed M. Elmogy,et al.  New Web cache replacement approaches based on internal requests factor , 2014, 2014 9th International Conference on Computer Engineering & Systems (ICCES).

[6]  Keqiu Li,et al.  An Improved GreedyDual Cache Document Replacement Algorithm , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[7]  Kin Yeung Wong,et al.  Web cache replacement policies: a pragmatic approach , 2006, IEEE Network.

[8]  Gürkan Gür.  Energy-aware cache management at the wireless network edge for information-centric operation , 2015, J. Netw. Comput. Appl..

[9]  Yin Yang,et al.  C-Aware: A Cache Management Algorithm Considering Cache Media Access Characteristic in Cloud Computing , 2013 .

[10]  Tinghuai Ma,et al.  Detect structural‐connected communities based on BSCHEF in C‐DBLP , 2016, Concurr. Comput. Pract. Exp..

[11]  Xuemin Shen,et al.  OUR: Optimal Update-based Replacement policy for cache in wireless data access networks with optimal effective hits and bandwidth requirements , 2013, Wirel. Commun. Mob. Comput..

[12]  Hala ElAarag,et al.  Web proxy cache replacement scheme based on back-propagation neural network , 2008, J. Syst. Softw..

[13]  Yang Xiao,et al.  An update-based step-wise optimal cache replacement for wireless data access , 2013, Comput. Networks.

[14]  Donald F. Towsley,et al.  Performance evaluation of hierarchical TTL-based cache networks , 2014, Comput. Networks.

[15]  Wei Tian,et al.  The performance improvements of highly-concurrent grid-based server , 2014, Simul. Model. Pract. Theory.

[16]  Valentin Puente,et al.  Improving last level shared cache performance through mobile insertion policies (MIP) , 2015, Parallel Comput..

[17]  Tinghuai Ma,et al.  A novel subgraph K+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K^{+}$$\end{document}-isomorphism method in social , 2017, Soft Computing.

[18]  Jan Reineke,et al.  Sensitivity of cache replacement policies , 2013, ACM Trans. Embed. Comput. Syst..

[19]  Tinghuai Ma,et al.  An efficient and scalable density-based clustering algorithm for datasets with complex structures , 2016, Neurocomputing.

[20]  Victor C. S. Lee,et al.  Efficient Cache Management for Network-Coding-Assisted Data Broadcast , 2017, IEEE Transactions on Vehicular Technology.

[21]  Ibrahim Abdullahi,et al.  Survey on caching approaches in Information Centric Networking , 2015, J. Netw. Comput. Appl..

[22]  Massimo Gallo,et al.  Performance evaluation of the random replacement policy for networks of caches , 2012, SIGMETRICS '12.

[23]  Benny Van Houdt,et al.  Transient and steady-state regime of a family of list-based cache replacement algorithms , 2016, Queueing Syst. Theory Appl..

[24]  Philippe Olivier Alexandre Navaux,et al.  Dynamic thread mapping of shared memory applications by exploiting cache coherence protocols , 2014, J. Parallel Distributed Comput..

[25]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[26]  Wei Tian,et al.  Weather data sharing system: an agent-based distributed data management , 2011, IET Softw..

[27]  Ajay D. Kshemkalyani,et al.  Objective-optimal algorithms for long-term Web prefetching , 2006, IEEE Transactions on Computers.

[28]  Lin Yao,et al.  A-CACHE: An anchor-based public key caching scheme in large wireless networks , 2015, Comput. Networks.

[29]  Michel Dubois,et al.  Cache replacement algorithms with nonuniform miss costs , 2006, IEEE Transactions on Computers.

[30]  D. V. L. N. Somayajulu,et al.  Dynamic Replication Algorithm for Data Replication to Improve System Availability: A Performance Engineering Approach , 2015 .

[31]  Antti Ylä-Jääski,et al.  Efficient cache availability management in Information-Centric Networks , 2015, Comput. Networks.

[32]  Sunil B. Mane,et al.  Analyzing different cache replacement policies on cloud , 2015, 2015 International Conference on Industrial Instrumentation and Control (ICIC).

[33]  Jian Shen,et al.  $$\varvec{\textit{KDVEM}}$$KDVEM: a $$k$$k-degree anonymity with vertex and edge modification algorithm , 2015, Computing.

[34]  Sang Lyul Min,et al.  On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies , 1999, SIGMETRICS '99.

[35]  Chao Fang,et al.  Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks , 2013 .

[36]  Jong-Myon Kim,et al.  A new cache replacement algorithm for last-level caches by exploiting tag-distance correlation of cache lines , 2015, Microprocess. Microsystems.

[37]  A. L. Narasimha Reddy,et al.  ARI: Adaptive LLC-memory traffic management , 2013, TACO.

[38]  Waleed Ali Ahmed.  Intelligent web proxy caching approaches based on machine learning techniques , 2012 .

[39]  Luigi Rizzo,et al.  Replacement policies for a proxy cache , 2000, TNET.

[40]  Tinghuai Ma,et al.  KDVEM : a k-degree anonymity with vertex and edge modification algorithm , 2015, Computing.