面向网络流量的缓存替换算法比较与分析  

Comparison and Analysis of Cache Replacement Algorithms for Network Traffic

作　　者：曹作伟 陈晓[1] 倪宏[1] CAO Zuo-wei;CHEN Xiao;NI Hong(National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China;School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing 100049, China)

机构地区：[1]中国科学院声学研究所国家网络新媒体工程技术研究中心,北京100190 [2]中国科学院大学电子电气与通信工程学院,北京100049

出　　处：《计算机与现代化》2019年第8期50-56,共7页Computer and Modernization

基　　金：国家科技重大专项资助项目(2017ZX03001019)

摘　　要：缓存替换算法对优化网络处理应用的性能起到关键作用,但目前面向网络流量的缓存替换算法研究主要集中在算法设计和领域应用方面,较少有文献对现有的缓存替换算法在网络环境下的性能进行分析比较。对此,本文针对主要的6种缓存替换算法进行分析和比较。通过分析网络流量的新近度与频度特征,为基于最近最少使用(Least Recently Used,LRU)和最近最不常使用(Least Frequently Used,LFU)的缓存替换算法给出实际依据。对仿真环境和实际系统的实验结果表明,类LRU算法较LFU算法更适用于网络流量,而缓存空间较大时,随机替换算法较LRU算法更适用于多核环境。The cache replacement algorithm plays a key role in optimizing the performance of network processing applications. The research on cache replacement algorithms for network traffic is mainly concentrated on the design and application of cache replacement algorithm. Yet analysis and comparative study for the performance of the existing cache replacement algorithm in the network environment are fewer. This paper analyzes and compares six major cache replacement algorithms. By analyzing the recency and frequency characteristics of network traffic, the practical basis for the cache replacement algorithm based on Least Recently Used (LRU) and Least Frequently Used (LFU) is given. The experimental results of the simulation environment and the actual system show that the LRU-like algorithm is more suitable for network traffic than the LFU algorithm, and the random replacement algorithm is more suitable for the multi-core environment than the LRU algorithm.

关 键 词：网络流量特征 缓存替换算法 LRU算法 LFU算法 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]