WO2020114133A1

WO2020114133A1 - Pq expansion implementation method, device, equipment and storage medium

Info

Publication number: WO2020114133A1
Application number: PCT/CN2019/112746
Authority: WO
Inventors: 胡忠花
Original assignee: 中兴通讯股份有限公司
Priority date: 2018-12-04
Filing date: 2019-10-23
Publication date: 2020-06-11
Also published as: CN111277513A; CN111277513B

Abstract

Disclosed in the present application are a priority queue (PQ) expansion implementation method, device, equipment and storage medium, the PQ expansion implementation method comprising: generating a PQ expansion request according to a configured QOS service; selecting a PQ queue number on the basis of the PQ expansion request; generating a simulation PQ queue number on the basis of a discarding threshold and the PQ queue number; and placing a QOS service message in the simulation PQ queue number.

Description

Method, device, equipment and storage medium for realizing expansion of PQ queue

This application requires the priority of the Chinese patent application filed on December 04, 2018 in the China Patent Office with the application number 201811473910.6. The entire contents of this application are incorporated by reference in this application.

Technical field

The present application relates to the field of communication but is not limited to the field of communication, in particular to a method, device, device and storage medium for implementing priority (Queueing, PQ) queue expansion.

Background technique

QoS (Quality of Service) is the quality of service. For network services, service quality includes transmission bandwidth, transmission delay, and data packet loss rate. In the network, the quality of service can be improved by ensuring the transmission bandwidth, reducing the transmission delay, reducing the data packet loss rate and delay jitter. Network resources are always limited, as long as there is a situation of snatching network resources, there will be requirements for service quality. Service quality is relative to network services. While ensuring the service quality of a certain type of service, it may be damaging the service quality of other services. For example, when the total network bandwidth is fixed, the more bandwidth a certain type of service occupies, the less bandwidth other services can use, which may affect the use of other services. Therefore, network administrators need to plan and allocate network resources reasonably according to the characteristics of various services, so that network resources can be used efficiently.

QoS technologies include traffic classification, traffic policing, traffic shaping, interface speed limiting, congestion management, and congestion avoidance.

Among them, congestion management generally uses queue technology, a queue algorithm is used to classify the traffic, and then a certain priority algorithm is used to send the traffic out. Currently widely used queue technology mainly includes: FIFO (first-in first-out queue), PQ (priority queue), WFQ (weighted fair queue), CBWFQ (class-based weighted fair queue) and so on.

PQ (Priority Queueing, priority queue) sends messages in strict accordance with the priority of the queue. If the number of hardware PQ queues that can support QoS scheduling is insufficient, the messages in the low priority queue will never be sent.

Summary of the invention

Embodiments of the present application provide a method, device, equipment, and storage medium for implementing PQ queue expansion.

In a first aspect, an embodiment of the present application provides a method for implementing capacity expansion of a PQ queue. The method includes:

Generate a PQ queue expansion request based on the configured QOS service;

Select the PQ queue number based on the PQ queue capacity expansion request;

Generate a simulated PQ queue number based on the discard threshold and the PQ queue number;

Put the QOS service message into the simulated PQ queue number.

As a specific implementation manner of the embodiment of the present application, the selection of the PQ queue number includes:

Select the PQ queue number in the resource pool.

As a specific implementation manner of the embodiment of the present application, the generating a PQ queue expansion request according to the configured QOS service includes:

Configure the number of PQ queues of the QOS service and the priority of the QOS service packets;

Generate a PQ queue expansion request based on the configured number of PQ queues.

As a specific implementation manner of the embodiment of the present application, after the step of placing the QOS service message in the simulated PQ queue number, the method further includes:

Restore the simulated PQ queue number to the PQ queue number.

As a specific implementation manner of the embodiment of the present application, the generation of the simulated PQ queue number based on the discard threshold and the PQ queue number includes:

Select multiple different discard thresholds;

Multiple simulated PQ queue numbers are generated based on the PQ queue number and multiple different drop thresholds.

As a specific implementation manner of the embodiment of the present application, putting the QOS service message into the simulated PQ queue number includes:

Query the information of the simulated PQ queue number;

Based on the query information, the packets of different preference levels are put into the corresponding analog PQ queue numbers.

In a second aspect, a device for implementing expansion of a PQ queue includes:

The configuration module is configured to generate a PQ queue expansion request according to the configured QOS service;

A control module configured to select a PQ queue number based on the PQ queue expansion request;

A determination module configured to generate an analog PQ queue number based on the discard threshold and the PQ queue number;

The enqueue module is configured to put the QOS service message into the simulated PQ queue number.

In a third aspect, a network device includes: a memory, a processor, and a computer program stored on the memory and executable on the processor, when the computer program is executed by the processor The steps of the method according to any of the first aspect are implemented.

According to a fourth aspect, a computer-readable storage medium has stored thereon a computer program, which when executed by a processor implements the steps of the method according to any one of the first aspects.

The embodiment of the present application generates a simulated PQ queue number based on the number of queues configured by the QOS service, and the simulated PQ queue is expanded relative to the number of hardware PQ queues, thereby solving the existing problem The problem of limiting the number of PQ queues that support QoS scheduling has achieved positive technical results.

The above description is only an overview of the technical solutions of this application. In order to understand the technical means of this application more clearly, it can be implemented according to the content of the specification, and to make the above and other purposes, features and advantages of this application more obvious The specific implementation of this application is listed below.

BRIEF DESCRIPTION

By reading the detailed description of the preferred embodiments below, various other advantages and benefits will become clear to those of ordinary skill in the art. The drawings are only for the purpose of showing the preferred embodiments, and are not considered as limitations to the present application. Furthermore, the same reference numerals are used to denote the same parts throughout the drawings. In the drawings:

1 is a diagram of an end-to-end QoS model in an embodiment of this application;

2 is a schematic diagram of sending PQ technical messages in an embodiment of the present application;

3 is a schematic diagram of differential discarding in the RED algorithm in the embodiment of the present application;

4 is a schematic diagram of differential discarding of WRED policies in an embodiment of the present application;

5 is a flowchart of a method for implementing capacity expansion of a PQ queue according to an embodiment of the present application;

6 is a flowchart of a method for implementing capacity expansion of a PQ queue according to an embodiment of the present application;

7 is a functional block diagram of a device for implementing expansion of a PQ queue according to an embodiment of the present application;

8 is a schematic block diagram of resources of a traffic management chip in Embodiment 4 of this application;

9 is a schematic diagram of queue priority scheduling in the prior art;

10 is a schematic diagram of queue priority scheduling after PQ queue expansion is used in Embodiment 4 of the present application;

FIG. 11 is a flowchart of a specific practical application described in Embodiment 4 of the present application.

detailed description

Hereinafter, exemplary embodiments of the present disclosure will be described in more detail with reference to the accompanying drawings. Although the exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

As shown in Figure 1, traffic classification, traffic policing, traffic shaping, congestion management and congestion avoidance mainly complete the following functions:

Flow classification: A certain rule is used to identify packets that meet certain characteristics, and differentiate services for network services.

Traffic policing: regulate the specific traffic entering or leaving the device. When the traffic exceeds the set value, restrictions or punishment measures can be taken to protect the network resources from damage. It can act on the inbound and outbound directions of the interface.

Traffic shaping: Actively adjust the output rate of the flow to adapt the flow to downstream equipment and network resources that can be supplied to avoid unnecessary packet discarding. It is usually used in the outbound direction of the interface.

Congestion management: When congestion occurs, a resource scheduling strategy is formulated to determine the processing order of packet forwarding, which usually acts on the outbound direction of the interface.

Congestion avoidance: monitor the usage of network resources, take the initiative to discard packets when congestion is found to increase, and adjust the length of the queue to relieve network overload, usually in the outbound direction of the interface.

Congestion management generally uses queue technology, which uses a queue algorithm to classify traffic, and then uses a certain priority algorithm to send these traffic out. Currently widely used queue technology mainly includes: FIFO (first-in first-out queue), PQ (priority queue), WFQ (weighted fair queue), CBWFQ (class-based weighted fair queue) and so on.

PQ (Priority Queueing, priority queue), PQ is designed for critical business applications. An important feature of key services is that when congestion occurs, priority is required to obtain services to reduce the response delay. PQ can flexibly specify priorities according to network protocols (such as IP, IPX), data inflow interface, packet length, source address/destination address, and so on. The priority queue divides the packets into four categories, namely high priority queue (high), middle priority queue (middle), normal priority queue (normal) and low priority queue (low), and their priorities are sequentially lowered. By default, the data flow enters the normal queue. as shown in picture 2. In queue scheduling, PQ strictly sends the packets in the higher priority queue in strict order from high to low. When the higher priority queue is empty, it sends the packets in the lower priority queue. In this way, placing the packets of the critical business in the queue of higher priority and placing the packets of the non-critical business in the queue of lower priority can ensure that the packets of the critical business are transmitted preferentially, and the packets of the non-critical business are processing the critical business The idle gap of data is transmitted.

The disadvantage of PQ is that if there are packets in the higher priority queue for a long time, the packets in the lower priority queue will never be served.

The congestion avoidance technology specifically adopts the following technologies:

Such as the existing packet loss strategy:

The existing packet loss strategy adopts the Tail-Drop method. When the length of the queue reaches a certain maximum value, all new packets will be discarded.

This drop strategy will cause TCP global synchronization phenomenon-when the queue drops multiple TCP connection packets at the same time, it will cause TCP timeout, which will cause TCP slow start and congestion avoidance mechanism, so that TCP reduces the transmission of packets.

2. RED and WRED.

To avoid TCP global synchronization, RED (Random Early Detection, random early detection) or WRED (Weighted Random Early Detection, weighted random early detection) can be used.

In the RED algorithm, an upper limit and a lower limit are set for each queue, and the packets in the queue are processed as follows: when the length of the queue is less than the lower limit, packets are not discarded; when the length of the queue exceeds the upper limit, all are discarded Incoming packets; when the length of the queue is between the upper limit and the lower limit, random packets are started to be discarded. The longer the queue, the higher the drop probability, but there is a maximum drop probability. As shown in Figure 3.

WRED combines DSCP and RED in the IP header to provide a drop threshold for priority traffic (high priority) that differs from standard traffic (lower priority). In other words, WRED selectively discards data packets based on DSCP (Differentiated Services Code) in the IP header. The difference discard threshold implemented by the WRED strategy is shown in Figure 4.

WRED monitors the average length of queues in network devices, so it can decide when to start dropping packets based on the queue length. The average length of the queue is the result of the queue length being low-pass filtered. It not only reflects the changing trend of the queue, but also is insensitive to the sudden change of the queue length, avoiding unfair treatment for sudden data flows.

When the average queue length exceeds the minimum drop threshold specified by the user, WRED begins to drop packets according to a certain drop probability. The longer the queue length, the higher the drop probability. If the average queue length exceeds the maximum drop threshold specified by the user, WRED switches to tail-of-line drop, that is, all subsequent packets will be dropped.

Drop Priority (Drop Priority, DP) is derived from the DSCP priority mapping in the IP packet header. The higher the precedence priority, the lower the drop probability.

An embodiment of the present application provides a method for implementing capacity expansion of a PQ queue. As shown in FIG. 5, the method may include the following steps:

Step S501: Generate a PQ queue expansion request according to the configured QOS service.

Configure the QOS service to divide IP packets into multiple queues and assign priorities to each queue, such as high priority queue, medium priority queue, normal priority queue and low priority queue, and then send PQ according to the number of queues and queue priority Queue expansion request.

In a specific application scenario, such as dividing QOSIP packets into 8 queues, when generating a PQ queue expansion request, it is necessary to include the information of the 8 queues, so that when expansion is known, it needs to be expanded to several PQ queues.

Step S502: Select a PQ queue number based on the PQ queue expansion request.

Selecting the PQ queue number is to select the PQ queue number of the specific hardware. In a specific application scenario, if a PQ queue expansion request that needs to be expanded to 8 PQ queues is received, the hardware required for expansion to 8 PQ queues is selected. PQ queue, such as selecting 4 hardware PQ queues. The PQ queue in this article refers to the hardware PQ queue number.

In some embodiments, the selection of the hardware PQ queue is selected in the resource pool. That is, all hardware PQ queues are placed in a resource pool. When you need to select a hardware PQ queue, go to the resource pool to query which hardware PQ queues are available, and then select the hardware PQ queues in the available state according to your needs, so as to get The PQ queue number of the selected hardware PQ queue. When the hardware PQ queue is not used, the corresponding hardware PQ queue should be released into the resource pool in time, so that other services can be called again, so as to set up the resource pool, and place all hardware PQ queues into the resource pool, which improves the hardware PQ queue. Use efficiency.

Step S503: Generate a simulated PQ queue number based on the discard threshold and the PQ queue number.

After the hardware PQ queue number is selected, based on the hardware PQ queue number information, the discard threshold information is filled to generate multiple simulated PQ queue numbers.

In a specific application scenario, the QOS service requires 8 queues, and on the basis of selecting 4 PQ queue numbers, 8 analog PQ queue numbers are generated by filling in the discard threshold information.

Step S504: Put the QOS service message into the simulated PQ queue number.

Put the queue of IP packets in the QOS service into the analog PQ queue number according to priority.

In a specific application scenario, after 8 simulated PQ queue numbers are generated, the 8 queues in the QOS service are placed into the corresponding 8 simulated PQ queue numbers according to the priority level. Then send them in order according to priority.

In an embodiment of the present application: Step S501: Generate a PQ queue expansion request according to the configured QOS service, including:

Configure the number of PQ queues of the QOS service and the priority of the QOS service packets.

Configure the QOS service to divide IP packets into multiple queues and assign priorities to each queue, such as high priority queue, medium priority queue, normal priority queue, and low priority queue.

The PQ queue expansion request is sent based on the number of queues and queue priority.

In an embodiment of the present application: Step S503: The generating a simulated PQ queue number based on the discard threshold and the PQ queue number includes:

Select multiple different discard thresholds.

You can select multiple discard thresholds, depending on the actual application. In a specific application scenario, select two discard thresholds.

The table information is modified based on the selected hardware PQ queue number and the selected discard threshold, thereby generating multiple simulated PQ queue numbers.

In a specific application scenario, after selecting 4 corresponding PQ queue numbers, after filling two discarding thresholds into 4 PQ queue numbers, 8 simulated PQ queue numbers are generated.

In an optional embodiment of the present application: Step 504: Put the QOS service message into the simulated PQ queue number, including:

Query the information of the simulated PQ queue number.

After the simulated PQ queue number is generated, the message information is assigned to the simulated PQ queue number according to the priority, and then the message information in the simulated PQ queue number is sequentially sent according to the priority.

An embodiment of the present application provides a method for implementing capacity expansion of a PQ queue. As shown in FIG. 6, the method includes the following specific steps:

Step S601: Generate a PQ queue expansion request according to the configured QOS service.

Configure the QOS service to divide IP packets into multiple queues and assign priorities to each queue, such as high priority queue, medium priority queue, normal priority queue, and low priority queue, and then send PQ according to the number of queues and queue priority Queue expansion request.

Step S602: Select a PQ queue number based on the PQ queue expansion request.

Optionally, the hardware PQ queue is selected in the resource pool. That is, all hardware PQ queues are placed in a resource pool. When you need to select a hardware PQ queue, go to the resource pool to query which hardware PQ queues are available, and then select the hardware PQ queues in the available state as needed to obtain The PQ queue number of the selected hardware PQ queue. When the hardware PQ queue is not used, the corresponding hardware PQ queue should be released into the resource pool in time, so that other services can be called again, so as to set up the resource pool, and place all hardware PQ queues into the resource pool, which improves the hardware PQ queue. Use efficiency.

Step S603: Generate a simulated PQ queue number based on the discard threshold and the PQ queue number.

Step S604: Put the QOS service message into the simulated PQ queue number.

Step S605: Restore the simulated PQ queue number to the PQ queue number.

After the packets in the simulated PQ queue number are sent, you need to restore the simulated PQ queue number to the original hardware PQ queue number, release the simulated PQ queue number, and put the PQ queue into the resource pool to be used by other QOS Business call.

An embodiment of the present application provides a device for implementing expansion of a PQ queue, as shown in FIG. 7, including:

The configuration module 701 is configured to generate a PQ queue expansion request according to the configured QOS service.

The control module 702 is configured to select a PQ queue number based on the PQ queue expansion request.

In some embodiments, the selection of the hardware PQ queue is selected in the resource pool. That is, all hardware PQ queues are placed in a resource pool. When you need to select a hardware PQ queue, go to the resource pool to query which hardware PQ queues are available, and then select the hardware PQ queues in the available state as needed to obtain The PQ queue number of the selected hardware PQ queue. When the hardware PQ queue is not used, the corresponding hardware PQ queue should be released into the resource pool in time, so that other services can be called again, so as to set up the resource pool and place all hardware PQ queues in the resource pool, which improves the hardware PQ queue. Use efficiency.

The determination module 703 is configured to generate an analog PQ queue number based on the discard threshold and the PQ queue number;

The enqueue module 704 is configured to put the QOS service message into the simulated PQ queue number.

After accessing the QOS service, the determination module backfills the expanded simulated PQ queue number to the enqueue module, and the traffic is classified into each simulated PQ queue according to the backfilled simulated PQ queue number.

In an embodiment of the present application: The configuration module 701 includes:

QOS service configuration module: configured to configure the number of POS queues of the QOS service and the priority of the QOS service packets.

Request generation module: configured to generate a PQ queue expansion request based on the configured number of PQ queues.

In an embodiment of the present application: the device further includes a release module: configured to restore the simulated PQ queue number to a PQ queue number.

In an embodiment of the present application: the determination module 703 includes: a threshold selection module: configured to select a plurality of different discard thresholds;

Simulated PQ queue number generation module: configured to generate multiple simulated PQ queue numbers based on the PQ queue number and multiple different discarding thresholds.

In an embodiment of the present application: the enqueue module 704 includes: a query module: configured to query the simulated PQ queue number information;

Message enqueue module: configured to put messages of different preferred levels into the corresponding analog PQ queue number based on the query information.

In an embodiment of the present application: the apparatus further includes: a table management module: configured to receive a PQ queue expansion request from the configuration module, and send the PQ queue expansion request to the control module.

This embodiment introduces an application example of the present application on the basis of the above embodiments and with reference to FIGS. 8-11.

A specific practical application of a method and a device for implementing capacity expansion of a PQ queue may include:

As shown in Figure 8, it is assumed that it is a resource allocation diagram of a traffic management chip: The queue from PQ in Figure 8 flows to the next-level node according to the setting of the tree, and the root preference level is irrelevant. For example, the queue of entity No. 0 at layer L3 always flows to entity No. 0 at layer L2. In the picture

with

Indicates four priority queues, → indicates all the four priority queues,

It indicates that according to the setting, when Host and Loopback are used, entities 30 and 31 of the L1 layer are invalid.

As shown in Figure 8, the number of resources of the traffic management chip is: L1, 2 (32 × 8), L3, 4 (4K × 4) mode, when L4 is attached to each L3, supports 4 priority level. A total of 16K L4PQ queues are supported. If the existing design satisfies the PQ queue support of more than 16K, or when each L3 is linked to L4, it is impossible to support more than 4 priorities.

That is, if a user occupies an L3 resource, a user needs to support priority scheduling of 8 types of service packets, which cannot be achieved in the existing PQ implementation method. Because the hardware restricts an L4 schedule with 4 priority levels under L3. Two L3 and 8 L4 queues must be used to achieve 8 queue priority scheduling as shown in Figure 9.

The steps can be shown in Figure 11:

S1101: Device initialization.

Initial state: No QOS service is connected, and all queues of the traffic management chip are to be allocated in the resource pool.

The allocation of PQ queues in the resource pool is as follows:

S1102: Application for QOS service and PQ queue expansion and stacking process.

The configuration module transparently transmits the strategy QOS service and PQ queue expansion mark containing 8 PQ queues to the table management module.

S1103: The table management module transparently transmits the PQ queue configuration and queue expansion flag to the traffic chip management module.

S1104: After receiving the information from the table management module, the traffic management chip module first allocates one port (L1), one subport (L2), one class (L3), and four queues (L4) from the resource pool as capacity expansion PQ simulation The basic scheduler and PQ queue of the queue.

Then generate table information FLOWID0, FLOWID1, FLOWID2, FLOWID3:

FLOWID0: 000000000000000000000000000000;

FLOWID1: 000000000000000000000000000001;

FLOWID2: 0000000000000000000000000010;

FLOWID3: 000000000000000000000000000011.

S1105: Two different queue depth thresholds (discard thresholds) are allocated at the same time. 1M and 2M match different precedence.

Convert the two queue depth thresholds into two different profile information and fill them into the 30th and 31st bits of FLOWID.

After reassembly, new table information is generated:

FLOWID0_EX1: 00000000000000000000000000000000;

FLOWID1_EX1: 00000000000000000000000000000001;

FLOWID2_EX1: 0000 0000 0000 0000 0000 0000 0000;

FLOWID3_EX1: 0000 0000 0000 0000 0000 0000 00001;

FLOWID0_EX2: 01000000000000000000000000000000;

FLOWID1_EX2: 01000000000000000000000000000001;

FLOWID2_EX2: 010000000000000000000000000000;

FLOWID3_EX2: 01000000000000000000000000000011.

S1106: Then backfill the new table information to the table management module. At the same time, the scheduling information configuration is configured to the underlying chip through the SDK.

S1107: The enqueue module sends the messages of different precedence to different analog PQ queue numbers by looking up the flowid information in the table management module. The actual enrollment is FLOWID0, FLOWID1, FLOWID2, FLOWID3. From the effect, it is 8 PQ services.

In summary, the QOS service of 8 PQ queues actually uses only 4 hardware queue resources, which greatly reduces the use of resources. Not only that, but under limited hardware resource limits, configuration examples that exceed hardware resource limits can be supported.

S1108: The QOS service is released.

The details of releasing the QOS service are as follows: the configuration module transparently transmits the policy QOS service and the PQ queue expansion mark of the released 8 PQ queues to the table management module.

The table management module transparently transmits the released eight PQ queue configurations and queue expansion marks to the traffic chip management module. At the same time, the table management module restores the backfilled flowid to the default value.

The traffic management chip module collects the scheduler information used by QOS scheduling, the scheduler used by QOS, and the PQ queue. The QOS parameters are restored to the default value and sent to the SDK to be written into the chip.

In this embodiment, fewer hardware queue resources are used, and more applications for queue configuration are realized. Save the hardware resources of the traffic management chip. In the case of limited resources, it can play a good role.

The generated scheduling resources are shown in FIG. 10. Comparing FIG. 9 with FIG. 10 shows that the hardware difference between this embodiment and the existing QOS method for implementing PQ pairs includes: This embodiment focuses on saving the traffic management chip The hardware queue resources of the module.

The prior art shown in FIG. 9 uses a total of 8 hardware queues to implement scheduling of 8 PQ queues.

The embodiment shown in FIG. 10 uses a total of 4 hardware queues and implements scheduling of 8 PQ queues. It is necessary to support the same number of PQ queues, and the hardware resource requirements in this embodiment are less.

In this embodiment, the configuration module, the table management module, and the traffic management chip management module all need to add a PQ queue expansion flag, and the flowid information interacted by the table management module and the flow management module adds two bytes of discard threshold information.

In summary, this embodiment has at least the following beneficial effects:

The traffic management chip module in the prior art includes N hardware scheduling queue resources, so the number of scheduling queues supporting QOS is at most N. There is a disadvantage of consuming resources. When the hardware scheduling queue resources are limited, the number of queues that can support QOS is limited, and the number of queues cannot be expanded. In this embodiment, when accessing the QOS service, a virtual PQ queue is simulated on the basis of actual hardware queue resources, which saves hardware scheduling queue resources and expands the number of queues that can support QOS services.

An embodiment of the present application provides a network device, which can be understood as a physical device, including a processor and a memory storing executable instructions of the processor. When the instructions are executed by the processor, the following operations are performed: configuring QOS Business, and generate a PQ queue expansion request based on the configured QOS service; select a PQ queue number based on the PQ queue expansion request; generate a simulated PQ queue number based on the drop threshold and the PQ queue number; convert the QOS service message Put in the analog PQ queue number.

For the specific embodiment process of the above method steps, refer to the first embodiment and the second embodiment, and this embodiment will not be repeated here.

The processor can be a general-purpose processor, such as a central processing unit (Central Processing Unit, CPU), a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or a One or more integrated circuits configured to implement the embodiments of the present application. Wherein, the memory is configured to store executable instructions of the processor; the memory is configured to store program code and transmit the program code to the processor. The memory may include volatile memory (Volatile Memory), such as random access memory (Random Access Memory, RAM); may also include non-volatile memory (Non-Volatile Memory), such as read-only memory (Read-Only Memory, ROM), flash memory (Flash), hard disk (HDD), or solid-state drive (SSD); it can also include a combination of the above types of memory.

An embodiment of the present application provides a computer-readable storage medium that stores a computer program on the computer-readable storage medium. When the computer program is executed by a processor, the following method steps are implemented: a QOS service is configured, and the The QOS service generates a PQ queue expansion request; based on the PQ queue expansion request, a PQ queue number is selected; a simulated PQ queue number is generated based on the discard threshold and the PQ queue number; the QOS service packet is placed in the simulated PQ queue number .

For the specific embodiment process of the above method steps, refer to the first embodiment and the second embodiment, and this embodiment will not be repeated here. Among them, the computer-readable storage medium includes, but is not limited to: ROM, RAM, magnetic disk or optical disk.

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.

The sequence numbers of the above embodiments of the present application are for description only, and do not represent the advantages and disadvantages of the embodiments.

Through the description of the above embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus the necessary general hardware platform, and of course, can also be implemented by hardware, but in many cases the former is better Implementation. Based on this understanding, the technical solution of the present application can essentially be embodied in the form of software products, and the computer software products are stored in a storage medium (such as ROM/RAM, magnetic disk, The CD-ROM includes several instructions to enable a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the embodiments of the present application.

The embodiments of the present application have been described above with reference to the drawings, but the present application is not limited to the above-mentioned specific implementations. The above-mentioned specific implementations are only schematic, not limiting, and those of ordinary skill in the art Under the inspiration of this application, there are many forms that can be made without departing from the scope of the application and the scope of the claims, all of which fall within the protection of this application.

Claims

A method for implementing the expansion of the priority queue PQ queue, including:

Generate PQ queue expansion request based on the configured quality of service QOS service;

Select the PQ queue number based on the PQ queue capacity expansion request;

Generate a simulated PQ queue number based on the discard threshold and the PQ queue number;

Put the QOS service message into the simulated PQ queue number.
The method of claim 1, wherein the selection of the PQ queue number includes:

Select the PQ queue number in the resource pool.
The method according to claim 1, wherein the generating the PQ queue expansion request according to the configured QOS service comprises:

Configure the number of PQ queues of the QOS service and the priority of the QOS service packets;

Generate a PQ queue expansion request based on the configured number of PQ queues.
The method according to claim 3, after the putting the QOS service message into the simulated PQ queue number, further comprising,

Restore the simulated PQ queue number to the PQ queue number.
The method of claim 4, wherein the generating of the simulated PQ queue number based on the discard threshold and the PQ queue number includes:

Select multiple different discard thresholds;

A plurality of simulated PQ queue numbers are generated based on the PQ queue number and the plurality of different discard thresholds.
The method according to claim 5, wherein the placing the message of the QOS service into the simulated PQ queue number includes:

Query the information of the simulated PQ queue number;

Based on the query information, the packets of different preference levels are put into the corresponding analog PQ queue numbers.
A device for realizing the expansion of priority queue PQ queue, including:

The configuration module is configured to generate a PQ queue expansion request according to the configured quality of service QOS service;

A control module configured to select a PQ queue number based on the PQ queue expansion request;

A determination module configured to generate an analog PQ queue number based on the discard threshold and the PQ queue number;

The enqueue module is configured to put the QOS service message into the simulated PQ queue number.
A network device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being implemented by the processor as claimed The method according to any one of 1 to 6.
A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.