Method and device for carrying out distribution control on cache space with multiple queues

Abstract

The embodiments of the present invention provide a method and device for controlling the allocation of a caching space and a computer storage medium. The method comprises: analyzing whether a queue to which a caching space to be shared is required to be allocated exists in each queue or not; when it is determined that the queue to which the caching space to be shared is required to be allocated exists, determining the number of queues to which the caching space to be shared is required to be allocated; and according to the determined number of the queues to which the caching space to be shared is required to be allocated, allocating the caching space to be shared to the queue to which the caching space to be shared is required to be allocated.

Description

technical field [0001] The present invention relates to the field of buffering, in particular to a method and device for allocating and controlling the buffering space of multiple queues. Background technique [0002] With the popularity of the Internet, information exchange and information sharing have become an indispensable part of people's daily life. With the continuous growth of interactive information (data packets) in the network, it will inevitably cause network congestion. Therefore, how to avoid congestion is particularly important. The congestion avoidance mechanism widely used on the Internet is RED (Random Early Discard) mechanism. The key to the RED mechanism is how to effectively use limited cache resources and perform reasonable discarding, so as to avoid congestion and ensure a smooth network. [0003] In the existing multi-queue cache of the RED device using the RED mechanism, the usual ways of allocating the cache include: method 1, which uses the metho...

AI Technical Summary

Problems solved by technology

[0004] However, there are unavoidable defects in the above method:

[0005] Defect 1. It is relatively simple to use the above method to divide the cache. However, since the cache of each queue is pre-allocated and fixed after allocation, it cannot be automatically adjusted according to the real-time network traffic of each queue. The cache utilization rate is low and lacks self-adaptation performance, and cannot really achieve the effect of shared cache, because after allocation, the maximum amount of cache that each queue can use is the part allocated to itself;

[0006] Defect 2. Using the above method 2 to share the cache, when the activation queue is small, the cache utilization rate is low, and the algorithm is relatively complicated, which is not conducive to hardware implementation

Images