Abstract: 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.

Key words: network traffic characteristics, cache replacement algorithm, LRU algorithm, LFU algorithm