Cache management method based on dynamic virtual threshold

Abstract

The invention discloses a cache management method based on a dynamic virtual threshold, and mainly solves the problem that in the prior art, under the condition of high cache utilization rate, settingfairness of queue thresholds cannot be guaranteed. The implementation scheme is as follows: 1) initializing cache management parameters of each queue; 2) judging whether the current data frame can enter a cache space or not, judging whether a cache manager needs to discard the data frame or not, and ending the cache management operation when no data frame reaches the cache space; 3) enabling thedata frames which are not cached and discarded to enter the cache space; 4) modifying the virtual threshold value of each queue once every T time; 5) enabling a dequeuing scheduler to take the data frames in the cache in each period, and return to step 2). According to the method, the data frames are discarded only when the cache is full, the dynamic virtual threshold cache is set for each queue,and the method has the advantages of being high in cache space utilization rate and good in fairness among the queues and can be used for network switching equipment.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a dynamic virtual threshold buffer management method, which can be used in network switching equipment. Background technique [0002] Buffer management is a key technology in network switching equipment. A good buffer management method can improve the utilization efficiency of buffer resources in switching equipment and reduce the frame loss rate of network exchange data frames. [0003] Existing cache management algorithms are mainly divided into three categories, namely static threshold strategy, dynamic threshold strategy, and PUSH-OUT strategy, among which: [0004] The static threshold strategy allocates a fixed-size cache for each queue. When the queue has remaining buffer space, the data frames arriving at this queue can enter the queue cache. When the queue has no remaining buffer space, the data frames arriving at this queue will be will be discarded. ...

AI Technical Summary

Problems solved by technology

However, since this strategy cannot match the real-time data frame information of each queue in real time, when the entire buffer space is full and the data frame is discarded, it cannot be discarded according to the historical queue length of other queues, which lacks certain fairness

Images