WO2020134425A1

WO2020134425A1 - Data processing method, apparatus, and device, and storage medium

Info

Publication number: WO2020134425A1
Application number: PCT/CN2019/112792
Authority: WO
Inventors: 肖洁; 廖庆磊; 谢小龙; 钱晓东
Original assignee: 深圳市中兴微电子技术有限公司
Priority date: 2018-12-24
Filing date: 2019-10-23
Publication date: 2020-07-02
Also published as: CN111355673A

Abstract

Embodiments of the present application provide a data processing method, apparatus, and device, and a storage medium. The method comprises: a server determines, according to the priorities of received data packets to be cached, a set of queues available for caching; determine a target cache queue from said set of queues according to attribute information of each queue available for caching in said set of queues and the priorities of said data packets; cache said data packets to the target cache queue.

Description

Data processing method, device, equipment and storage medium

Technical field

The embodiments of the present application relate to the field of Internet technologies, and in particular, to a data processing method, device, equipment, and storage medium.

Background technique

In the current network communication, there are often communication requirements of multiple service levels. In order to ensure the communication requirements with high timeliness, the storage and forwarding of messages are generally handled by priority queues.

In these forwarding schemes, a buffer space is provided for each service priority. When a packet arrives, it first resolves the service level to which the packet belongs by parsing the characteristic field of the packet, maps the packet to the corresponding service priority, and then queries the queue cache of the priority to which the packet belongs. If the corresponding priority is cached If the occupancy is too large, the packet is discarded, otherwise the packet is written to the corresponding priority queue buffer. In the allocation of caches for each priority queue, the method of allocating caches independently for each queue is generally adopted, and the cache allocation is performed according to the relationship between the total depth of each queue's allocated cache and the actual total amount of cache.

However, the solutions in the prior art have problems of cache idleness and high-priority cache occupation.

Summary of the invention

The following is an overview of the topics detailed in this article. This summary is not intended to limit the scope of protection of the claims.

Embodiments of the present application provide a data processing method, device, device, and storage medium.

In a first aspect, an embodiment of the present application provides a data processing method. The method includes: the server determines a set of queues to be cached according to a priority of a data packet to be cached sent by a terminal; according to each of the set of queues to be cached Attribute information of the queue to be cached and the priority of the data packet to be cached, determine a target cache queue from the set of queues to be cached; cache the data packet to be cached into the target cache queue.

In a second aspect, an embodiment of the present application provides a data processing apparatus, the apparatus including:

The first determining unit is configured to determine the set of queues to be cached according to the priority of the received data packets to be cached;

The second determining unit is configured to determine the target cache queue from the queue-to-be-cached set based on the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached; and

The cache unit is configured to cache the data packet to be cached into the target cache queue.

In a third aspect, an embodiment of the present application provides a data processing device, the device at least includes: a processor and a storage medium configured to store executable instructions, wherein: the processor is configured to execute the stored executable instructions; The executable instruction is configured to perform the above data processing method.

According to a fourth aspect, an embodiment of the present application provides a storage medium in which computer-executable instructions are stored, and the computer-executable instructions are configured to execute the foregoing data processing method.

After reading and understanding the drawings and detailed description, other aspects can be understood.

Brief description of the drawings

In the drawings (which are not necessarily drawn to scale), similar reference numbers may describe similar components in different views. Similar reference numbers with different letter suffixes may indicate different examples of similar parts.

FIG. 1 is a schematic diagram of an implementation process of the data processing method provided in Embodiment 1 of the present application;

2 is a schematic diagram of an implementation process of the data processing method provided in Embodiment 2 of the present application;

3 is a schematic diagram of an implementation process of the data processing method provided in Embodiment 3 of the present application;

4 is a schematic diagram of an implementation process of the data processing method provided in Embodiment 4 of the present application;

FIG. 5 is a schematic diagram of a relationship of cache space that can be occupied by each priority according to an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a data processing device provided by an embodiment of the present application;

7 is a schematic diagram of an implementation process of a data processing method provided by an embodiment of this application;

8 is a schematic diagram of an implementation process of a message reading process in the data processing method provided by an embodiment of this application;

9 is a schematic structural diagram of a composition of a data processing device provided by an embodiment of this application;

FIG. 10 is a schematic structural diagram of a data processing device provided by an embodiment of the present application.

Elaborate

In the subsequent description, the use of suffixes such as “module”, “part” or “unit” used to represent elements is only for the benefit of the description of the present application, and has no specific meaning in itself. Therefore, "module", "component" or "unit" can be used in a mixed manner.

In the current network communication, there are often multiple service level communication requirements, such as voice calls, video calls, web browsing, file transfers, etc. Some communication requirements have high requirements for the timeliness of data packets and message forwarding, such as Video call; some communication requirements have lower requirements for the timeliness of data packet and message forwarding, such as web browsing. However, from the perspective of routing and forwarding, all communication packets are mixed into the router and are waiting to be processed. Therefore, in order to ensure timely communication requirements, the priority queue is generally used to process the storage and forwarding of packets.

In these forwarding schemes, a buffer space is provided for each service priority. When a message arrives, it first resolves the service level to which the message belongs by parsing the characteristic field of the message, maps the message to the corresponding service priority, and then queries the cache of the queue to which the message belongs, if the corresponding priority If the queue buffer occupancy is too large, the message is discarded, otherwise the message is written to the corresponding priority queue buffer. When the output port is idle, the highest priority queue with packets is selected according to the service level of the priority queue, and the queue is given priority. When the enqueue bandwidth of the high-priority queue is less than the port bandwidth, the high-priority queue will get the most timely service, ensuring the low-latency demand of the high-priority queue.

In the allocation of priority queue caches, each queue is generally allocated independently, that is, the sum of the maximum caches that can be occupied by all priority queues does not exceed the system cache maximum. In this way, when the output bandwidth of the low-priority queue cannot be obtained and the buffer is occupied, it will not affect the enqueuing and dequeuing of packets of other priority queues.

However, when there is no high-priority packet input by the router, a part of the cache capacity will be wasted. For example, in the mutually exclusive configuration mode of cache allocation, a router sets up four priority queues, and sets the maximum cache depth T for each queue, and T*4<total cache AT. If there are only two lower priority packets entering the router in a certain period of time, half of the depth buffer will be idle and wasted. Since the input traffic may change at any time, it is impossible to solve this problem by adjusting the preset maximum cache depth.

If you set the total depth of all queues to be greater than the total cache depth, you can effectively avoid the problem of excessive cache being wasted. For example, in the preemptive configuration method in cache allocation, a router sets up four priority queues, and sets the maximum cache depth T<total cache AT and T*4>total cache AT for each queue. Then, when there are only two lower priority packets entering the router in a certain period of time, the wasted buffer will be less than half the depth. However, if 2T>AT, and the input bandwidth is greater than the output bandwidth, the total buffer will be exhausted by these two lower priority packets. If high-priority packets resume traffic at this time, the problem occurs that the high-priority packets cannot occupy the cache, causing high-priority packets to be discarded.

It can be seen that the mutual exclusion configuration method in the related art has the problem of idle cache, and the preemption configuration method has the problem of high priority cache being occupied.

Based on the above-mentioned problems in the related art, embodiments of the present application provide a data processing method that, by preempting by priority, while reserving cache for high-priority queues, provides greater cache occupation opportunities for low-priority queues At the same time, it avoids the problem that the cache of the mutually exclusive configuration mode is idle in the traditional queue cache allocation and the problem of the high-priority cache occupied by the preemption configuration mode. Through the data processing method, the internal cache of the device can be used more effectively, and the effect of prioritized service can be achieved.

FIG. 1 is a schematic flowchart of an implementation of a data processing method provided in Embodiment 1 of the present application. As shown in FIG. 1, the method includes steps S101-S103.

Step S101: The server determines the set of queues to be cached according to the priority of the received data packets to be cached.

For example, the server may be a network server in a switching network system or a routing system, and the server may receive a data packet to be cached sent by a terminal through a router. The data packet to be buffered may be sent by the terminal in the form of a data packet, or may be sent by the terminal in the form of a data packet. In addition, the server can also receive data packets to be cached sent by other servers.

After receiving the data packet to be cached, the server performs feature analysis on the data packet to be cached to determine the priority corresponding to the characteristic of the data packet to be cached. For example, the priority of a video call is higher than the priority of web browsing. Assuming that the priority level corresponding to the highest priority is 0, you can set the priority level of a video call to 0. Therefore, when the server receives the data packet of the video call, after the feature analysis, the priority level corresponding to the video call is 0.

In this embodiment, priority level 0 is greater than (i.e. higher than) priority level 1, priority level 1 is greater than priority level 2, and priority level 2 is greater than priority level 3.... In other embodiments, other levels of arrangement may also be used.

After the server determines the priority of the data packet to be cached, the server determines the set of queues to be cached according to the priority of the data packet to be cached.

In this embodiment, the set of queues to be cached includes at least one queue to be cached, and the queue to be cached is used to cache data packets, for example, the data packets to be cached. The queue to be cached may already have data packets cached, and the queue to be cached may also be an empty queue that does not cache any data packets.

In an exemplary embodiment, the server may divide the cache space of the data processing system into a preset number of queues to be cached in advance, and each queue to be cached is used to cache data packets that meet certain conditions. For example, the cache space can be divided into a preset number of queues to be cached that buffer packets of different priorities, that is, a video call with a priority level of 0 corresponds to a queue to be cached; a network browsing with a priority level of 4 corresponds to Another queue to be cached.

In this embodiment, after determining the priority of the data packet to be cached, at least one queue to be cached that satisfies a preset condition may be determined among all the queues to be cached in the cache space to form the set of queues to be cached. The preset condition may be that the priority is greater than or equal to (≥) the priority of the data packet to be cached.

Step S102: Determine a target cache queue from the queue-to-be-cached set according to the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached.

In this embodiment, the attribute information of the queue to be cached includes at least one of the following: the number of cached data packets in the queue to be cached, and the memory space occupied by the cached data packets in the queue to be cached. Wherein, the number of cached data packets can be counted according to the number of data packet fragments and the number of data packets as a unit of measurement; the memory space occupied by the cached data packets can be measured in terms of bits, bytes, etc. statistics.

In this embodiment, before determining the target cache queue, according to the attribute information of each queue to be cached and the priority of the data packet to be cached, it is determined whether the data packet to be cached is allowed to be cached to a certain set in the queue to be cached Waiting in the cache queue. If allowed, then cache the data packet to be cached into the target cache queue. The target cache queue is a queue to be cached selected from the set of queues to be cached. In this way, the data packets to be cached can be cached to the target cache queue only if the conditions are met, so that high-priority caches can be avoided.

Step S103: Cache the data packet to be cached into the target cache queue.

Here, when it is determined that the data packet to be cached is allowed to be cached in the target cache queue in the set of queues to be cached, the data packet to be cached is cached in the target cache queue to ensure that the data packet to be cached can be Effective transmission.

In the data processing method provided by the embodiment of the present application, the server determines the set of queues to be cached according to the priority of the received data packets to be cached; according to the attribute information of each queue to be cached in the set of queues to be cached and the to-be-cached The priority of the data packet determines the target cache queue from the set of queues to be cached; caches the data packet to be cached into the target cache queue. In this way, because the target cache queue is determined according to the attribute information of each queue to be cached and the priority of the data packet to be cached, the purpose of preempting the cache queue by priority can be achieved, thereby avoiding queue cache allocation The problem of idle cache and the problem of high priority cache being occupied.

FIG. 2 is a schematic flowchart of an implementation of the data processing method provided in Embodiment 2 of the present application. As shown in FIG. 2, the method includes steps S201-S204.

In step S201, the server compares the priority of each queue to be cached with the priority of the data packet to be cached.

Here, each of the queues to be cached has a preset priority. For example, the cache space may be divided into multiple queues to be cached, and each queue to be cached is used to cache different data packets, for example, video call data packets, file transfer data packets, and web browsing data packets. The queue to be cached for buffering video call data packets has a higher priority than the queue to be buffered for buffering network browsing data packets. The priority of each queue to be cached is fixed.

In this embodiment, after receiving the data packet to be cached, the server compares the priority of the data packet to be cached with the priority of all queues to be cached in the system.

Step S202: Determine a queue to be cached whose priority is greater than or equal to the priority of the data packet to be cached as the set of queues to be cached.

Here, after comparing the priority of the data packet to be cached with the priority of all the queues to be cached in the system, a queue to be cached with a priority greater than or equal to the priority of the data packet to be cached is selected to form the set of queues to be cached, That is to say, the set of queues to be cached contains at least one queue to be cached, and the priority of all queues to be cached in the set of queues to be cached is greater than or equal to the priority of the data packets to be cached.

Step S203: Determine the target cache queue from the queue-to-be-cached set according to the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached.

Here, before determining the target cache queue, according to the attribute information of each queue to be cached and the priority of the data packet to be cached, it is determined whether the data packet to be cached is allowed to be cached to a certain queue in the queue set to be cached Cache queue. If allowed, then cache the data packet to be cached into the target cache queue. The target cache queue is a queue to be cached selected from the set of queues to be cached. In this way, the data packets to be cached can be cached to the target cache queue only if the conditions are met, so that high-priority caches can be avoided.

Step S204: Cache the data packet to be cached into the target cache queue.

In the data processing method provided by the embodiment of the present application, the server compares the priority of each queue to be cached with the priority of the data packet to be cached; the queue to be cached with a priority greater than or equal to the priority of the data packet to be cached, Determined as the set of queues to be cached; according to the attribute information of each queue to be cached in the set of queues to be cached and the priority of the data packet to be cached, a target cache queue is determined from the set of queues to be cached; Cache the data packet to be cached into the target cache queue. In this way, because the target cache queue is determined according to the attribute information of each queue to be cached and the priority of the data packet to be cached, the purpose of preempting the cache queue by priority can be achieved, thereby avoiding queue cache allocation The problem of idle cache and the problem of high priority cache being occupied.

FIG. 3 is a schematic flowchart of an implementation of the data processing method provided in Embodiment 3 of the present application. As shown in FIG. 3, the method includes steps S301-S304.

Step S301: The server determines the set of queues to be cached according to the priority of the data packets to be cached sent by the terminal.

Here, the set of queues to be cached has at least one queue to be cached, and each of the queues to be cached has a preset priority. For example, the cache space may be divided into multiple queues to be cached, and each queue to be cached is used to cache different data packets.

In this embodiment, the priority of the data packet to be cached can be compared with the priority of all the queues to be cached in the system, and then a queue to be cached with a priority greater than or equal to the priority of the data packet to be cached can be selected to form the to-be-cached Queue collection.

Step S302: For each queue to be cached in the queue-to-be-cached set, determine whether to allow the data packet to be cached according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information To the corresponding queue to be cached.

Here, the attribute information of the queue to be cached includes at least one of the following: the number of cached data packets in the queue to be cached, and the memory space occupied by the cached data packets in the queue to be cached. Correspondingly, the preset threshold corresponding to the attribute information includes at least one of the following: a quantity threshold and a memory space threshold.

Then, the process of step S302 in this embodiment includes the following three implementation methods:

Method 1: The attribute information of the queue to be cached is the number of cached data packets in the queue to be cached, and the preset threshold corresponding to the attribute information is the quantity threshold;

For each queue to be cached in the queue set to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow the cached data packet to be cached to The corresponding queue to be cached includes: for each queue to be cached in the queue to be cached set, if the number of the cached data packets in each queue to be cached is less than or equal to the number of corresponding queues to be cached The threshold value allows the data packet to be cached to be cached in the corresponding queue to be cached.

Method 2: The attribute information of the queue to be cached is the memory space occupied by the cached data packets in the queue to be cached, and the preset threshold corresponding to the attribute information is the memory space threshold;

For each queue to be cached in the queue set to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow the cached data packet to be cached to The corresponding queue to be cached includes: for each queue to be cached in the queue to be cached set, if the memory space occupied by the cached data packet in each queue to be cached is less than or equal to the corresponding queue to be cached Threshold of the memory space, it is allowed to cache the data packet to be cached into the corresponding queue to be cached.

Method 3: The attribute information of the queue to be cached is the number of cached data packets in the queue to be cached and the memory space occupied by the cached data packets, and the preset threshold corresponding to the attribute information is the quantity threshold and the memory space threshold ;

For each to-be-cached queue in the to-be-cached queue set, according to the attribute information of each to-be-cached queue and a preset threshold corresponding to the attribute information, determine whether to allow caching of the to-be-cached data packet To the corresponding queue to be cached includes: for each queue to be cached in the queue to be cached set, if the number of buffered data packets in each queue to be cached is less than or equal to the threshold of the number of queues to be cached , And the memory space occupied by the cached data packet is less than or equal to the memory space threshold of the corresponding queue to be cached, it is allowed to cache the data packet to be cached into the corresponding queue to be cached.

In this embodiment, the number of cached data packets in the attribute information of the queue to be cached may be counted according to the number of data packet fragments and the number of data packet packets as a unit of measurement; the cached data packet occupancy The memory space can be calculated based on bits, bytes, etc. for the measurement unit.

In this embodiment, the preset threshold corresponding to the attribute information is determined according to the priority of the queue to be cached, that is, each queue to be cached corresponds to a preset threshold, and the The threshold is different. When the priority of a queue to be cached is higher than the priority of other queues to be cached, the preset threshold of the queue to be cached is also greater than the preset threshold of other queues to be cached.

For example, the preset threshold corresponding to the Nth cache queue may be determined according to the preset priority of the Nth queue to be cached in the set of queues to be cached; wherein, if the Nth queue to be cached The preset priority of the queue is higher than the preset priority of the Mth queue to be cached, then the preset threshold corresponding to the Nth cache queue is greater than the preset threshold corresponding to the Mth buffer queue.

In this embodiment, the attribute information of all queues to be cached in the queue set to be cached is compared with the corresponding preset threshold, and only the attribute information of all queues to be cached and the corresponding preset threshold satisfy the above three methods Can be determined to allow the data packet to be cached to the corresponding queue to be cached, as long as the attribute information of any queue to be cached and the corresponding preset threshold do not satisfy the three ways (Any one determined to be executed), it is forbidden to cache the data packet to be cached into the corresponding queue to be cached.

Step S303: For each queue to be cached in the queue-to-be-cached set, if the result is determined to be allowed, from the queue-to-be-cached set, a queue to be cached with the same priority as the data packet to be cached , Determined as the target cache queue.

Here, the priority of the target cache queue is the same as the priority of the data packet to be cached. The set of queues to be cached is determined according to the queues to be cached whose priority is greater than or equal to the priority of the data packets to be cached. Then, that is to say, the target cache queue having the same priority as the data packet to be cached is the queue to be cached with the lowest priority in the set of queues to be cached.

Therefore, step S303 can also be achieved by the following steps:

Step S3031: For each queue to be cached in the queue-to-be-cached set, if the determination result is allowed, from the queue-to-be-cached set, the queue to be cached with the lowest priority is determined as the target cache queue.

In other embodiments, the method further includes the following steps:

Step S310, if there are at least one queue to be cached in the set of queues to be cached, the number of the cached data packets is greater than the corresponding threshold value of the queue to be cached, then discard the data packets; and/or, if In the set of queues to be cached, if the memory space occupied by the cached data packet with at least one queue to be cached is greater than the memory space threshold of the corresponding queue to be cached, the data packet is discarded.

Here, the determination that the data packet to be cached is discarded includes the following three types:

In the first type, it is judged that in the set of queues to be cached, the number of cached data packets in which at least one queue to be cached is greater than a threshold corresponding to the number of queues to be cached.

Second, it is determined that in the set of queues to be cached, the memory space occupied by the cached data packets of at least one queue to be cached is greater than the threshold of the memory space corresponding to the queue to be cached.

Thirdly, it is judged that in the set of queues to be cached, there is at least one queue to be cached whose number of cached data packets is greater than the threshold corresponding to the number of queues to be cached, and The memory space is greater than the memory space threshold corresponding to the queue to be cached.

Step S304: Cache the data packet to be cached into the target cache queue.

According to the data processing method provided in the embodiment of the present application, for each queue to be cached in the queue queue to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow The data packet to be cached is cached into a corresponding queue to be cached. In this way, because the attribute information of each queue to be cached and the corresponding preset threshold are judged to determine whether the data packet to be cached is allowed to enter the queue to be cached, the target cache queue is determined and cached only when permitted Cache data packets, therefore, the purpose of prioritizing cache queue preemption can be achieved, thereby avoiding the problem of cache idleness in queue cache allocation and the problem of high priority cache being occupied.

FIG. 4 is a schematic flowchart of an implementation of a data processing method provided in Embodiment 4 of the present application. As shown in FIG. 4, the method includes steps S401-S406.

Step S401: The server determines the set of queues to be cached according to the priority of the received data packets to be cached.

Step S402: Determine the target cache queue from the queue-to-be-cached set according to the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached.

Step S403: Cache the data packet to be cached into the target cache queue.

Steps S401 to S403 are the same as the above steps S101 to S103, and details are not described in this embodiment.

Step S404, when the cached data packet flows out of the cache queue, it is determined that the priority of the cache queue that caches the cached data packet is the cache priority.

Here, the cached data packet flowing out of the cache queue may be a cached data packet flowing out of any cache queue in the system, that is to say, the cache queue may be the queue to be cached in the aforementioned queue to be cached set, It may not be the queue to be cached in the aforementioned queue to be cached set, as long as there is a cached data packet outflow in any one of the cache queues in the current data processing system, the action of step S404 is performed to determine the cache of the cached data packet The priority of the cache queue is the cache priority. That is, the priority of the buffer queue that buffers the outgoing buffered data packet is determined, and the priority is determined as the buffer priority.

Step S405: Determine the attribute information of the cache queue whose priority is greater than or equal to the cache priority as the target attribute information.

Here, first, the priority of all cache queues in the system is compared with the size of the cache priority; then, the attribute information of the cache queue whose priority is greater than the cache priority is determined as the target attribute information.

Step S406: Update the target attribute information.

In this embodiment, updating the attribute information of the cache queue whose priority is greater than or equal to the cache priority includes the following three cases:

Case 1: When the number of cached data packets flowing out of the cache queue is counted on a statistical basis, the number of cached data packets in the cache queue is updated.

Case 2: When the cached data packets flowing out of the cache queue are counted based on the size of the memory space, the memory space occupied by the cached data packets in the cache queue is updated.

Case 3: When the number of cached data packets flowing out of the cache queue is counted based on statistics and the size of the memory space, the number of cached data packets in the cache queue and the memory space occupied are updated.

In this embodiment, when there are cached data packets flowing out of the cache queue, the attribute information of all cache queues whose priority is higher than and equal to the outgoing cache queue is updated.

In the data processing method provided by the embodiment of the present application, when the cached data packet flows out of the cache queue, the priority of the cache queue that caches the cached data packet is determined as the cache priority, and the priority is greater than the cache priority of the cache The attribute information of the queue is determined as the target attribute information, and the target attribute information is updated. In this way, it can be ensured that when a data packet flows out of the cache queue, the attribute information of the cache queue is updated in time to ensure that the data packets to be cached that subsequently enter the queue can be effectively cached.

Based on the above embodiments, the data processing method provided by the embodiments of the present application, through the method of priority preemption, while reserving cache for high-priority queues, provides greater cache occupation opportunities for low-priority queues while avoiding traditional In the queue cache allocation, the mutual exclusion configuration mode cache is idle and the preemption configuration mode high priority cache is occupied. In this way, the internal cache of the device can be used more effectively, and the effect of prioritized services can be achieved.

In an exemplary embodiment, an embodiment of the present application further provides a data processing method, including the following steps one and two.

Step 1: Receive the data packet to be cached, and determine the target cache queue corresponding to the priority according to the priority of the data packet to be cached;

The processing device for implementing the method of this embodiment may be any device that has a buffer queue processing requirement, for example, it may be a server, and it may not be a terminal. The data packet to be buffered received by the device may be sent by the terminal, or may be sent by another server.

The processing device is preset with two or more cache queues, and each cache queue corresponds to a priority level, and is used to receive cache data packets corresponding to the priority levels.

Step 2: Determine whether to cache the data packet to be cached into the target cache queue according to the attribute information of all cache queues whose priority is not lower than the target cache queue, the attribute information is used to indicate that the corresponding cache queue is currently Cache situation.

By judging the current cache conditions of all other cache queues that are higher than or equal to the target cache queue, to decide whether to allow the cached data packet to be cached, priority is given to ensuring the work of high priority cache queues, and avoiding low priority cache data Excessive packets occupy the total cache.

In an exemplary embodiment, the attribute information of the cache queue includes the number of cached data packets in the queue;

The second step is implemented in the following manner:

Determine that the priority is not lower than the number of cached data packets in each cache queue of the target cache queue, if the difference between the number of cached data packets in each cache queue and the threshold value of the corresponding cache queue is greater than or equal to Corresponding to the first difference threshold (first condition) of the cache queue, it is determined that the data packet to be cached is cached in the target cache queue, if the number of cached data packets of any one cache queue is the same as that of the corresponding cache queue If the difference between the number thresholds is less than or equal to the second difference threshold (second condition), it is determined not to cache the data packet to be cached into the target cache queue; wherein, the priority is not lower than the target cache The cache queue of the queue refers to: all cache queues including the target cache queue whose priority is not lower than the target cache queue.

In this embodiment, the attribute information of the cache queue includes the number of cached data packets in the queue. Correspondingly, a threshold is set for each cache queue to indicate the maximum number of cache queues that can be cached. At the same time, a first difference threshold and a second difference threshold can also be set for each cache queue. Both the first difference threshold and the second difference threshold can be used to reflect the reserved space of the current cache queue. The difference is that A difference threshold is used when judging whether to buffer the data packet, and a second difference threshold is used when judging whether to discard the data packet. The first difference threshold and the second difference threshold set for the same cache queue may be the same or different. When the first difference threshold and the second difference threshold set for the same cache queue are the same, the above “equal to difference threshold” judgment step only needs to keep one of the first condition or the second condition, that is, when the first When the judgment in one condition is “greater than or equal to”, the judgment in the second condition may be “less than”, and when the judgment in the first condition is “greater than”, the judgment in the second condition may be “less than or equal to”.

By setting the difference threshold and the above-mentioned caching mechanism, on the one hand, high-priority caches can be avoided, and on the other hand, priority caching of high-priority packets can be better ensured. For example, when the number of data packets cached in a high-priority cache queue is close to the number threshold, the cache of low-priority packets can be blocked to avoid the high-priority cache being occupied, but when the data cached in the high-priority cache queue When the number of packets is not close to the number threshold, the cache in the high-priority cache queue can still be occupied by low-priority packets to avoid the high-priority cache being idle.

In an exemplary embodiment, the attribute information of the cache queue may further include memory space occupied by cached data packets in the queue;

At this time, the second step is implemented in the following manner:

Determine that the priority is not lower than the number of cached data packets of each cache queue of the target cache queue, if the difference between the memory space occupied by the cached data packets of each cache queue and the memory space threshold of the corresponding cache queue is greater than Or equal to the third difference threshold (third condition) of the corresponding cache queue, it is determined that the data packet to be cached is cached in the target cache queue, if the memory space occupied by the cached data packet of any cache queue is equal to If the difference in the memory space threshold of the corresponding cache queue is less than or equal to the fourth difference threshold (fourth condition) of the corresponding cache queue, it is determined that the data packet to be cached is not cached in the target cache queue; wherein, the A cache queue whose priority is not lower than the target cache queue refers to: all cache queues including the target cache queue whose priority is not lower than the target cache queue.

In this embodiment, the attribute information of the cache queue includes the memory space occupied by the cached data packets in the queue. Correspondingly, a memory space threshold is set for each cache queue to indicate the maximum memory space that the cache queue can cache. At the same time, a third difference threshold and a fourth difference threshold can also be set for each cache queue. Both the third difference threshold and the fourth difference threshold can be used to reflect the reserved space of the current cache queue. The difference is that The three difference threshold is used when judging whether to buffer the data packet, and the fourth difference threshold is used when judging whether to discard the data packet. The third difference threshold and the fourth difference threshold set for the same cache queue may be the same or different. When the third difference threshold and the fourth difference threshold set for the same cache queue are the same, the above determination step of “equal to the difference threshold” only needs to keep one of the third condition or the fourth condition.

In an exemplary embodiment, in step two, when it is determined that the to-be-cached data packet is cached in the target cache queue, the method further includes: updating all priority levels not lower than the target cache queue Attribute information of the cache queue of the; where the cache queue with a priority not lower than the target cache queue refers to: all cache queues including the target cache queue with a priority not lower than the target cache queue .

In this embodiment, the preset threshold (number threshold or memory space threshold) of each cache queue is less than the total cache, and the sum of the preset thresholds of all cache queues is greater than the total cache. In other words, all cache queues share the same cache area, so after caching data packets, the attribute information of all cache queues whose priority is not lower than the target cache queue is updated to reflect the current cache occupancy overall and comprehensively , So as to ensure that the data packets to be cached subsequently entered the queue can be effectively cached.

In an exemplary embodiment, the method further includes: updating any attribute information of the cache queue whose priority is not lower than the cache queue when the cache data packet in any cache queue is dequeued; wherein, the priority A cache queue not lower than the exit cache queue refers to: all cache queues including the exit cache queue whose priority is not lower than the exit cache queue.

From which cache queue the cached data packet flows out, the cache queue is the out-cache queue. As mentioned above, since all cache queues share the same cache area, when a data packet is dequeued, the attribute information of all cache queues with a priority not lower than the cache queue is updated to reflect the current situation in a comprehensive and comprehensive manner Cache occupancy, so as to ensure that subsequent packets to be cached can be effectively cached.

The method of the embodiment of the present application is explained in detail below.

In this embodiment, first, n queues with a priority relationship (corresponding to the queues to be cached) are numbered 0 to n-1, wherein the highest priority queue number is 0, the second highest priority queue number is 1, and again The high priority queue number is 2... and so on, the lowest priority queue number is n-1.

Set a counter cnt _x (x=0~n-1) for each queue, and record the buffer depth occupied by the queue (corresponding to the above attribute information). The counter can be in units of cache measurement units such as bits, bytes, number of fragments, or number of packets.

Set a discarding threshold T _x (x=0~n-1) for each queue. The setting of the discarding threshold (corresponding to the preset threshold above) follows the following relationship: T ₀ >T ₁ >......>T _n-1 . That is, the drop threshold of the high priority queue is greater than the drop threshold of the low priority queue.

When a message (corresponding to the above-mentioned data packet to be buffered) arrives, if the priority of the message belongs to i, determine the counter and discard threshold of all queues with x≤i (x=0~n-1), if cnt _x <T _x (x=0~n-1, x≤i), then the message can enter the cache, as long as there is a cnt _x greater than or equal to the corresponding <T _x , the message is discarded.

In other embodiments, the less-than sign in the above expression can also be changed to less than or equal to the sign, that is, in other embodiments, the above-mentioned cnt _x <T _x can also be cnt _x ≤ T _x .

If the judgment result indicates that the message can enter the queue buffer, the counters of all the queues with x≤i (x=0~n-1) are increased correspondingly according to the counter unit and the message length. For example, if the message is in units of bits, it increases according to the number of bits in the message; if the message is in units of bytes, it increases according to the number of bytes in the message.

When a certain message (assuming that the message priority is j) is read from the cache and the cache is released, all queues satisfying x≤j (x=0~n-1) are also processed according to the rules for entering the cache The counter is reduced accordingly according to the counter unit and the message length.

The above scheme enables high-priority messages to occupy the cache space of low-priority messages, but low-priority messages cannot occupy the cache space of high-priority messages. Using the above scheme, the relationship of cache space that can be occupied by each priority is shown in Figure 5.

5, each priority packets may occupy a maximum _{T x (x = 0 ~ n} -1) of the cache space, i.e., each cache buffer queue is less than the maximum T _x of the total buffer space that is, all the buffer queue the T _x can be greater than the sum of the maximum cache space. Any priority queue can occupy more cache space when some other priority traffic is missing. At the same time, when the lower-priority queue is congested, the high-priority queue still has more space for it to occupy, and the low-priority queue will not consume the cache and cause high-priority packets to be lost.

FIG. 6 is a schematic diagram of the composition structure of the data processing device provided in the embodiment of the present application. As shown in FIG. 6, the data processing device includes a queue depth counter module 601, an enqueue judgment module 602, an enqueue depth calculation module 603, and an outgoing Team depth calculation module 604, in which:

The queue depth counter module 601 is set to maintain a corresponding buffer occupation depth counter for each priority queue;

The enqueue judging module 602 is set to, when a message arrives, if the priority of the message belongs to i, judge the counters and discard thresholds of all queues with x≤i (x=0~n-1), if cnt _x <T _x (x=0~n-1, x≤i), then the message can enter the cache, if cnt _x ≥T _x , the message is discarded. According to the design needs, the less than sign in the above expression can also be changed to less than or equal to sign, accordingly, the greater than or equal sign can be changed to greater than sign;

The enqueue depth calculation module 603 is set to increase all counters of x≤i (x=0~n-1) according to the counter unit and the length of the message if it is judged that the message can enter the cache;

The dequeuing depth calculation module 604 is configured to set the counters of all queues of x≤j (x=0~n-1) according to the counter unit and the length of the message if the message with priority j is to be read out of the cache Do a corresponding reduction.

An embodiment of the present application also provides a data processing method, which can be operated by a queue polling device implemented using a sliding window. FIG. 7 is a schematic flowchart of an implementation process of the data processing method provided by an embodiment of the present application, as shown in FIG. 7 The method includes the following steps S701-S704.

In step S701, when the system is powered on, each queue depth counter is initialized to 0.

In step S702, it is detected that a message enters.

Step S703, when the message enters the system, it is judged according to the message priority i whether the counters and discarding thresholds of all queues with x≤i (x=0~n-1) satisfy the expression cnt _x <T _x (x=0 ~n-1, x≤i).

According to the design requirements, the less than sign in the above expression can also be changed to less than or equal to sign.

In step S704, if the judgment result in step S703 is yes, the message is enqueued; if the message is enqueued, the counters of all queues with x≤i (x=0~n-1) are combined according to the counter unit and The message length is increased accordingly.

In step S705, if the judgment result in step S702 is NO, the message is discarded.

FIG. 8 is a schematic diagram of an implementation process of a message reading process in a data processing method provided by an embodiment of the present application. As shown in FIG. 8, the method includes the following steps S801-S802.

In step S801, it is detected that a message is read.

In step S802, if a message is dequeued, the counters of all queues with x≤j (x=0~n-1) are reduced according to the counter unit and the message length according to the message priority j.

The implementation of the technical solution of the embodiments of the present application is described in further detail below:

Suppose that there are n priority queues. Now, n=5 is used as an example to describe in detail. The priority of the queues is Q ₀ , Q ₁ , Q ₂ , Q ₃ , and Q ₄ from high to low. Five buffer depth counters cnt ₀ , cnt ₁ , cnt ₂ , cnt ₃ , cnt _{4 are} provided for the five priority levels. In this example, the depth counter uses the number of packets as the statistical unit, and the drop thresholds of the five priority queues are T ₀ , T ₁ , T ₂ , T ₃ , and T ₄ , respectively, and satisfy T ₀ >T ₁ >T ₂ >T ₃ >T ₄ .

When packets with priority 4 enter the system, compare the following expressions:

cnt ₀ <T ₀ ; cnt ₁ <T ₁ ; cnt ₂ <T ₂ ; cnt ₃ <T ₃ ; cnt ₄ <T ₄ .

When all the above conditions are met, the message enters the queue Q ₄ , and cnt ₀ , cnt ₁ , cnt ₂ , cnt ₃ , and cnt ₄ are increased by one respectively; if one of the above conditions is not met, the message is discarded and the counter remains unchanged.

When packets with priority 3 enter the system, compare the following expressions:

cnt ₀ <T ₀ ; cnt ₁ <T ₁ ; cnt ₂ <T ₂ ; cnt ₃ <T ₃ .

When all the above conditions are met, the message enters the queue Q ₃ , and cnt ₀ , cnt ₁ , cnt ₂ , and cnt ₃ are increased by one respectively; if one of the above conditions is not met, the message is discarded and the counter is unchanged.

When packets with priority 2 enter the system, compare the following expressions:

cnt ₀ <T ₀ ; cnt ₁ <T ₁ ; cnt ₂ <T ₂ .

When all the above conditions are met, the message enters the queue Q ₂ , and cnt ₀ , cnt ₁ , and cnt ₂ are increased by one respectively; if one of the above conditions is not met, the message is discarded and the counter is unchanged.

When packets with priority 1 enter the system, compare the following expressions:

cnt ₀ <T ₀ ; cnt ₁ <T ₁ .

When all the above conditions are met, the message enters the queue Q ₁ , and cnt ₀ and cnt ₁ are increased by one respectively; if one of the above conditions is not met, the message is discarded and the counter is unchanged.

When a message with a priority of 0 enters the system, the following expression is compared: cnt ₀ <T ₀ .

When the above conditions are met, the message enters the queue Q ₀ and cnt _{0 is} increased by one; if the above conditions are not met, the message is discarded and the counter remains unchanged.

When there is a message in the system to leave the team, for example:

When a packet with a priority of 4 is to be dequeued from queue Q ₄ , cnt ₀ , cnt ₁ , cnt ₂ , cnt ₃ , and cnt ₄ are each decremented by one.

When packets with priority 3 are to be dequeued from queue Q ₃ , cnt ₀ , cnt ₁ , cnt ₂ , and cnt ₃ are each decremented by one.

When packets with priority 2 are to be dequeued from queue Q ₂ , cnt ₀ , cnt ₁ and cnt ₂ are decremented by one respectively.

When packets with priority 1 are to be dequeued from queue Q ₁ , cnt ₀ and cnt ₁ are decremented by one respectively.

When packets with priority 0 are to be dequeued from queue Q ₀ , cnt _{0 is} decreased by one.

The data processing method provided by the embodiment of the present application, by preempting the priority method, while reserving the cache for the high-priority queue, provides a greater chance of cache occupation for the low-priority queue, and avoids the traditional queue cache allocation Mutually exclusive configuration mode cache is idle and preemption configuration mode high priority cache is occupied. According to the method of the embodiment of the present application, each priority packet can occupy a maximum of T _x (x=0~n-1) cache space, and any priority queue can be changed when some other priority traffic is missing. Take up more cache space. At the same time, when the lower-priority queue is congested, the high-priority queue still has more space for it to occupy, and the low-priority queue will not consume the cache and cause high-priority packets to be lost.

Based on the foregoing embodiments, embodiments of the present application provide a data processing apparatus including each unit included and each module included in each unit, which may be implemented by a processor in a data processing device; Of course, it can also be realized by a logic circuit; in the implementation process, the processor may be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA).

FIG. 9 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application. As shown in FIG. 9, the data processing apparatus 900 includes a first determining unit 901, a second determining unit 902, and a cache unit 903, where:

The first determining unit 901 is configured to determine the set of queues to be cached according to the priority of the received data packets to be cached;

The second determining unit 902 is configured to determine the target cache queue from the queue-to-be-cached set according to the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached ;

The cache unit 903 is configured to cache the data packet to be cached into the target cache queue.

In an exemplary embodiment, each of the queues to be cached has a preset priority; correspondingly, the first determination unit 901 includes a comparison module and a first determination module, where:

The comparison module is configured to compare the priority of each queue to be cached with the priority of the data packet to be cached;

The first determining module is configured to determine a queue to be cached with a priority greater than or equal to the priority of the data packet to be cached as the set of queues to be cached.

In an exemplary embodiment, the second determination unit 902 includes a second determination module and a third determination module, where:

The second determining module is configured to determine, for each queue to be cached in the set of queues to be cached, based on the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, whether to allow all The data packet to be cached is cached into the corresponding queue to be cached;

The third determination module is set to each queue to be cached in the queue-to-be-cached set, if the determination result is allowed, from the queue-to-be-cached set, priority will be given to the data packet to be cached The queue to be cached with the same level is determined as the target cache queue.

In an exemplary embodiment, the attribute information of the queue to be cached includes at least one of the following in the queue to be cached: the number of cached data packets and the memory space occupied by the cached data packets, corresponding to the attribute The preset threshold corresponding to the information includes at least one of the following: quantity threshold and memory space threshold;

Correspondingly, the second determination module includes a first control module and/or a second control module, wherein:

The first control module is configured to, for each queue to be cached in the queue set to be cached, if the number of the cached data packets in each queue to be cached is less than or equal to the number of corresponding queues to be cached Threshold, it is allowed to cache the data packet to be cached into the corresponding queue to be cached;

The second control module is set for each queue to be cached in the queue to be cached set, if the memory space occupied by the cached data packet in each queue to be cached is less than or equal to the corresponding queue to be cached Threshold of the memory space, it is allowed to cache the data packet to be cached into the corresponding queue to be cached.

In an exemplary embodiment, the apparatus further includes a third determination unit, a fourth determination unit, and an update unit, where:

The third determining unit is configured to determine that the priority of the cache queue to cache the cached data packet is the cache priority when the cached data packet flows out of the cache queue;

The fourth determining unit is configured to determine the attribute information of the cache queue whose priority is greater than or equal to the cache priority as the target attribute information;

The update unit is configured to update the target attribute information.

In an exemplary embodiment, the apparatus further includes a first discarding unit and/or a second discarding unit, wherein:

The first discarding unit is configured to discard the data to be cached if the number of the cached data packets in at least one queue to be cached in the set of queues to be cached is greater than the corresponding threshold value of the number of queues to be cached package;

The second discarding unit is configured to discard the memory space of the cached data packet where at least one queue to be cached occupies more than a memory space threshold corresponding to the queue to be cached in the set of queues to be cached Packets to be cached.

It should be noted that, in the embodiments of the present application, if the above data processing method is implemented in the form of a software function module and sold or used as an independent product, it may also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present invention may be embodied in the form of software products in essence or part of contributions to related technologies. The computer software products are stored in a storage medium and include several instructions to make A terminal executes all or part of the methods described in various embodiments of the present invention. The foregoing storage media include various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (Read Only Memory, ROM), a magnetic disk, or an optical disk. In this way, the embodiments of the present invention are not limited to any specific combination of hardware and software.

Correspondingly, an embodiment of the present application provides a data processing device. FIG. 10 is a schematic structural diagram of the composition of the data processing device provided by the embodiment of the present application. As shown in FIG. 10, the data processing device 1000 at least includes: a processor 1001 , A communication interface 1002 and a storage medium 1003 configured to store executable instructions, wherein:

The processor 1001 is configured to control the overall operation of the data processing device 1000.

The communication interface 1002 is configured to enable the data processing device to communicate with other terminals or servers through the network.

The storage medium 1003 is configured to store instructions and applications executable by the processor 1001, and can also cache data to be processed or processed by the processor 1001 and each module in the data processing device 1000, which can be accessed through flash memory (FLASH) or random access Memory (Random Access Memory, RAM) implementation.

It should be understood that “one embodiment” or “one embodiment” mentioned throughout the specification means that a specific feature, structure, or characteristic related to the embodiment is included in at least one embodiment of the present invention. Therefore, “in one embodiment” or “in one embodiment” appearing throughout the specification does not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. It should be understood that, in various embodiments of the present invention, the size of the sequence numbers of the above processes does not mean the order of execution order, and the execution order of each process should be determined by its function and inherent logic, and should not correspond to the embodiments of the present invention. The implementation process constitutes no limitation. The sequence numbers of the above embodiments of the present invention are for description only, and do not represent the advantages and disadvantages of the embodiments.

It should be noted that in this article, the terms "include", "include" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device that includes a series of elements includes not only those elements, It also includes other elements that are not explicitly listed, or include elements inherent to this process, method, article, or device. Without more restrictions, the element defined by the sentence "include one..." does not exclude that there are other identical elements in the process, method, article or device that includes the element.

In the several embodiments provided in this application, it should be understood that the disclosed device and method may be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the units is only a division of logical functions. In actual implementation, there may be other division methods, such as: multiple units or components may be combined, or Can be integrated into another system, or some features can be ignored, or not implemented. In addition, the displayed or discussed components are coupled to each other, or directly coupled, or the communication connection may be through some interfaces, and the indirect coupling or communication connection of the device or unit may be electrical, mechanical, or other forms of.

The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units; they may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above integration The unit can be implemented in the form of hardware, or in the form of hardware plus software functional units.

Those of ordinary skill in the art may understand that all or part of the steps to implement the above method embodiments may be completed by program instructions related hardware. The foregoing program may be stored in a computer-readable storage medium. When the program is executed, the execution includes The steps of the foregoing method embodiments; and the foregoing storage media include various media that can store program codes, such as a mobile storage device, a read-only memory (Read Only Memory, ROM), a magnetic disk, or an optical disk. Alternatively, if the above integrated unit of the present invention is implemented in the form of a software function module and sold or used as an independent product, it may also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present invention may be embodied in the form of software products in essence or part of contributions to related technologies. The computer software products are stored in a storage medium and include several instructions to make A terminal executes all or part of the methods described in various embodiments of the present invention. The foregoing storage media include various media that can store program codes, such as mobile storage devices, ROM, magnetic disks, or optical disks.

The above are only the embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present invention. Covered within the protection scope of the present invention.

Claims

A data processing method, including:

The server determines the set of queues to be cached according to the priority of the received data packets to be cached;

Determine the target cache queue from the queue-to-be-cached set according to the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached;

Cache the data packet to be cached into the target cache queue.
The method according to claim 1, wherein each queue to be cached has a preset priority;

The server determines the set of queues to be cached according to the priority of the data packets to be cached sent by the terminal, including:

The server compares the priority of each queue to be cached with the priority of the data packet to be cached;

A queue to be cached with a priority greater than or equal to the priority of the data packet to be cached is determined as the queue to be cached set.
The method according to claim 1, wherein said determining from the set of queues to be cached is based on the attribute information of each queue to be cached in the set of queues to be cached and the priority of the data packet to be cached Target cache queue, including:

For each queue to be cached in the set of queues to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow the cached data packet to be cached to the corresponding To be cached in the queue;

For each to-be-cached queue in the to-be-cached queue set, if the determination result is allowed, from the to-be-cached queue set, the to-be-cached queue having the same priority as the to-be-cached data packet is determined to be all Describe the target cache queue.
The method of claim 3, wherein

The attribute information of the queue to be cached includes the number of cached data packets, and the preset threshold corresponding to the attribute information includes a number threshold;

For each queue to be cached in the queue set to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow the cached data packet to be cached to The corresponding queue to be cached includes:

For each to-be-cached queue in the to-be-cached queue set, if the number of the cached data packets in each to-be-cached queue is less than or equal to the corresponding threshold value of the to-be-cached queue, the to-be-cached is allowed The data packet is cached in the corresponding queue to be cached;

and / or,

The attribute information of the queue to be cached includes the memory space occupied by the cached data packets, and the preset threshold corresponding to the attribute information includes the memory space threshold;

For each queue to be cached in the queue set to be cached, according to the attribute information of each queue to be cached and a preset threshold corresponding to the attribute information, it is determined whether to allow the cached data packet to be cached to The corresponding queue to be cached includes:

For each to-be-cached queue in the to-be-cached queue set, if the memory space occupied by the cached data packet in each to-be-cached queue is less than or equal to the memory space threshold of the corresponding to-be-cached queue, the The data packet to be cached is cached into the corresponding queue to be cached.
The method according to claim 4, further comprising:

When the cached data packet flows out of the cache queue, it is determined that the priority of the cache queue to cache the cached data packet is the cache priority;

Determining the attribute information of the cache queue whose priority is greater than or equal to the cache priority as the target attribute information;

Update the target attribute information.
The method according to claim 4, further comprising:

If there is at least one queue to be cached in the set of queues to be cached, the number of the cached data packets is greater than the corresponding threshold of the number of queues to be cached, then the data packet to be cached is discarded;

and / or,

If in the set of queues to be cached, the memory space occupied by the cached data packets of at least one queue to be cached is greater than the memory space threshold of the corresponding queue to be cached, then the data packets to be cached are discarded.
A data processing method, including:

Receiving the data packet to be cached, and determining the target cache queue corresponding to the priority according to the priority of the data packet to be cached;

Determine whether to cache the data packet to be cached into the target cache queue according to attribute information of all cache queues whose priority is not lower than the target cache queue, and the attribute information is used to indicate the current cache situation of the corresponding cache queue.
The method according to claim 7, wherein the attribute information of the cache queue includes the number of cached data packets in the queue;

The determining whether to cache the data packet to be cached into the target cache queue according to the attribute information of all cache queues whose priority is not lower than the target cache queue includes:

Determine that the priority is not lower than the number of cached data packets in each cache queue of the target cache queue, if the difference between the number of cached data packets in each cache queue and the threshold value of the corresponding cache queue is greater than or equal to Corresponding to the first difference threshold of the cache queue, it is determined that the data packet to be cached is cached in the target cache queue, if the difference between the number of cached data packets of any cache queue and the corresponding threshold value of the number of corresponding cache queues is less than Or equal to the second difference threshold, it is determined that the data packet to be cached is not cached into the target cache queue; wherein, the cache queue whose priority is not lower than the target cache queue refers to: including the All priority levels including the target cache queue are not lower than the cache queue of the target cache queue.
The method according to claim 7, wherein the attribute information of the cache queue includes memory space occupied by cached data packets in the queue;

The determining whether to cache the data packet to be cached into the target cache queue according to the attribute information of all cache queues whose priority is not lower than the target cache queue includes:

Determine that the priority is not lower than the number of cached data packets of each cache queue of the target cache queue, if the difference between the memory space occupied by the cached data packets of each cache queue and the memory space threshold of the corresponding cache queue is greater than Or equal to the third difference threshold of the corresponding cache queue, it is determined that the data packet to be cached is cached in the target cache queue, if the memory space occupied by the cached data packet of any cache queue and the memory of the corresponding cache queue If the difference of the space threshold is less than or equal to the fourth difference threshold of the corresponding cache queue, it is determined not to cache the data packet to be cached into the target cache queue; wherein, the priority is not lower than the target cache queue The cache queue refers to: all cache queues including the target cache queue with a priority not lower than the target cache queue.
The method according to claim 7, after determining that the data packet to be cached is cached in the target cache queue, the method further comprises: updating all cache queues whose priority is not lower than the target cache queue Attribute information; wherein, the cache queue whose priority is not lower than the target cache queue refers to: all cache queues including the target cache queue whose priority is not lower than the target cache queue.
The method according to claim 7, further comprising:

When any cached data packet in the cache queue is dequeued, the attribute information of all cache queues whose priority is not lower than the cache queue is updated; wherein, the cache queue whose priority is not lower than the cache queue refers to: including all All priority levels including the cache queue are not lower than the cache queue of the cache queue.
A data processing device, including:

The first determining unit is configured to determine the set of queues to be cached according to the priority of the received data packets to be cached;

The second determining unit is configured to determine the target cache queue from the queue-to-be-cached set based on the attribute information of each queue-to-be-cached in the queue-to-be-cached set and the priority of the data packet to be cached; and

The cache unit is configured to cache the data packet to be cached into the target cache queue.
The device according to claim 12, wherein each queue to be cached has a preset priority;

The first determining unit includes:

A comparison module configured to compare the priority of each queue to be cached with the priority of the data packet to be cached; and

The first determining module is configured to determine a queue to be cached whose priority is greater than or equal to the priority of the data packet to be cached as the set of queues to be cached.
A data processing device, the device at least includes: a processor and a storage medium configured to store executable instructions, wherein: the processor is configured to execute the stored executable instructions;

The executable instruction is configured to execute the data processing method provided in any one of claims 1 to 6 or 7 to 11 above.
A storage medium in which computer-executable instructions are stored, the computer-executable instructions being configured to perform the data processing method provided in any one of claims 1 to 6 or 7 to 11 above.