Queue congestion control method and device, storage medium and computer equipment

Abstract

The invention relates to the technical field of wireless network communication, and discloses a queue congestion control method and device, a storage medium and computer equipment, and the method comprises the steps: firstly obtaining an average queue length and an average flow rate of a transmission queue in a scheduling period, and determining a congestion index of the transmission queue based on the average queue length and the average flow rate, the congestion index is used for representing the congestion degree of the transmission queue, and then comparing the congestion index with a preset congestion index threshold; and when the congestion index is greater than or equal to a congestion index threshold, adjusting the initial value of the EDCA parameter of the transmission queue, and sending the data of the transmission queue based on the adjusted EDCA parameter. According to the method, the state of the transmission queue is accurately acquired based on the congestion index, and the EDCA parameter is dynamically adjusted, so that the data of the high-priority queue is quickly accessed to the channel, the resources are released, the congestion is relieved, the throughput rate of a wireless communication network is increased, and the delay of the data in the high-priority queue is reduced.

Description

Technical Field

[0001] The present invention relates to the technical field of wireless network communication, and in particular, to a queue congestion control method, apparatus, storage medium, and computer device. Background Art

[0002] In the process of network communication, buffers for temporarily storing data to be sent are organized according to certain rules to form queues, so as to orderly manage and schedule different types of data. Each queue can have different priority and Quality of Service (QoS) requirements to ensure that critical service data can be processed and transmitted in a timely manner.

[0003] In modern wireless networks, in order to more finely manage and process different types of traffic flows, multiple Access Category (AC) queues are usually set up. Each AC queue is optimized for a specific type of data stream to meet the different QoS requirements of different types of applications. For example, video traffic is divided into high-definition AC_KVI, AC_DVI, and AC_VI for ordinary video data; voice data is further divided into AC_DVO with higher delay QoS requirements and AC_VO for ordinary voice data according to its delay sensitivity. In this way, it can be ensured that data requiring higher QoS guarantee can obtain channel resources preferentially, thereby reducing delay and improving transmission quality. Although this method can significantly improve the QoS of critical services in theory, in the actual application process, increasing the number of access queues will greatly increase the collision probability between different stations during channel competition and data transmission, resulting in a series of consequences such as intensified channel competition, increased retransmission times, decreased channel utilization rate, and affecting user experience.

[0004] Therefore, there is an urgent need to study a queue congestion control method that can improve the overall throughput of the network, reduce transmission delay, enhance user experience, and optimize the allocation and utilization efficiency of network resources on the premise of ensuring the QoS requirements of services. Summary of the Invention

[0005] In view of this, the present application provides a queue congestion control method, apparatus, storage medium, and computer device, mainly aiming to solve the technical problem in the prior art that increasing access queues will increase the collision probability between different stations during channel competition and data transmission.

[0006] According to the first aspect of the present invention, a queue congestion control method is provided, and the method includes:

[0007] Obtain the average queue length and average flow rate of the transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and the average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue;

[0008] Compare the congestion index with a preset congestion index threshold;

[0009] When the congestion index is greater than or equal to the congestion index threshold, adjust the initial value of the EDCA parameter of the transmission queue, and send the data of the transmission queue based on the adjusted EDCA parameter.

[0010] Optionally, the obtaining the average queue length and average flow rate of the transmission queue in a scheduling period includes: periodically obtaining the average queue length and average flow rate of the transmission queue in a scheduling period based on a preset time interval.

[0011] Optionally, the calculation formula of the congestion index is: CI = avg Q / avg F +0.001, where: CI is the congestion index of the transmission queue, avg Q is the average queue length of the transmission queue in a scheduling period, avg F is the average flow rate of the transmission queue in a scheduling period.

[0012] Optionally, the EDCA parameters of the transmission queue include: arbitration inter-frame space and random backoff window.

[0013] Optionally, the adjusting the initial value of the EDCA parameter of the transmission queue includes: calculating the product of the arbitration inter-frame space in the EDCA parameter and a preset parameter, and using the product as the adjusted arbitration inter-frame space, where the preset parameter is greater than 0 and less than 1; obtaining the minimum value of the random backoff window in the EDCA parameter, and half of the random backoff window in the EDCA parameter, and selecting the minimum value of the minimum value of the random backoff window and half of the random backoff window as the adjusted random backoff window.

[0014] Optionally, the sending the data of the transmission queue based on the adjusted EDCA parameter includes: detecting the sending state of the channel; when detecting that the sending state of the channel is an idle state, waiting after the arbitration inter-frame space in the EDCA parameter and passing through the random backoff window in the EDCA parameter, and sending the data of the transmission queue through the channel.

[0015] Optionally, after adjusting the initial value of the EDCA parameter for the transmission queue and sending the data of the transmission queue based on the adjusted EDCA parameter, the method further includes: when the congestion index is less than the congestion index threshold, restoring the adjusted EDCA parameter to the initial value of the EDCA parameter.

[0016] According to a second aspect of the present invention, there is provided a queue congestion control device, the device comprising:

[0017] An index calculation module, configured to obtain the average queue length and the average flow rate of a transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and the average flow rate, wherein the congestion index is used to characterize the congestion degree of the transmission queue;

[0018] An index comparison module, configured to compare the congestion index with a preset congestion index threshold;

[0019] A parameter adjustment module, configured to, when the congestion index is greater than or equal to the congestion index threshold, adjust the initial value of the EDCA parameter of the transmission queue, and send the data of the transmission queue based on the adjusted EDCA parameter.

[0020] According to a third aspect of the present invention, there is provided a storage medium, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned queue congestion control method is implemented.

[0021] According to a fourth aspect of the present invention, there is provided a computer device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the program, the above-mentioned queue congestion control method is implemented.

[0022] A method, device, storage medium and computer device for queue congestion control provided by the present invention first obtain the average queue length and average flow rate of a transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue, and then compare the congestion index with a preset congestion index threshold; when the congestion index is greater than or equal to the congestion index threshold, adjust the initial value of the EDCA parameter of the transmission queue, and send the data of the transmission queue based on the adjusted EDCA parameter. The above method calculates the congestion index of the transmission queue, monitors and accurately identifies the congestion degree of the transmission queue in real time, comprehensively and truly obtains the state of the queue, and adopts a dynamic and flexible adjustment method. When the transmission queue is in a congested state, it can timely adjust its own EDCA parameter, so that the data of the high-priority queue can quickly access the channel, thereby releasing resources, alleviating congestion, effectively avoiding the impact of increasing the collision probability caused by adding access categories, and then significantly increasing the throughput of the wireless communication network and reducing the delay of the data in the high-priority queue.

[0023] The above description is only an overview of the technical solution of this application. In order to be able to understand the technical means of this application more clearly, it can be implemented according to the content of the specification. And in order to make the above and other purposes, features and advantages of this application more obvious and understandable, the following specifically gives the specific implementation manners of this application. Brief Description of the Drawings

[0024] The drawings described herein are used to provide a further understanding of the present invention, and constitute a part of this application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0025] Figure 1 A flowchart showing the process of a method for queue congestion control provided by an embodiment of the present invention;

[0026] Figure 2 A flowchart showing the process of another method for queue congestion control provided by an embodiment of the present invention;

[0027] Figure 3 A schematic diagram of the distributed coordination mechanism of a method for queue congestion control provided by an embodiment of the present invention;

[0028] Figure 4 A flowchart showing the principle of the scheduling algorithm of a method for queue congestion control provided by an embodiment of the present invention;

[0029] Figure 5 A simulation result diagram of a method for queue congestion control provided by an embodiment of the present invention;

[0030] Figure 6The figure shows a schematic structural diagram of a queue congestion control device provided by an embodiment of the present invention;

[0031] Figure 7 The figure shows a schematic structural diagram of another queue congestion control device provided by an embodiment of the present invention;

[0032] Figure 8 The figure shows a schematic structural diagram of a device of a computer device provided by an embodiment of the present invention. Detailed implementation manners

[0033] Hereinafter, exemplary embodiments of the present application will be described in more detail with reference to the accompanying drawings. Although the exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided so that the present application can be more thoroughly understood and the scope of the present application can be fully conveyed to those skilled in the art.

[0034] An embodiment of the present application provides a queue congestion control method, as Figure 1 shown, the method includes the following steps:

[0035] 101. Obtain the average queue length and average flow rate of the transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue.

[0036] Among them, the scheduling period refers to the time interval for the system to manage and schedule resources. During this time period, the system will collect relevant data and perform necessary calculations and adjustments. Among them, the average queue length of the transmission queue in a scheduling period refers to that within a scheduling period, the system records the length change of the transmission queue and calculates the average value during this period. The average flow rate of the transmission queue in a scheduling period refers to that the system records the speed at which data enters and leaves the queue in the transmission queue and calculates the average value during this period. The average queue length and average flow rate are used to calculate the congestion index of the transmission queue to evaluate the congestion status of the transmission queue.

[0037] In the embodiment of the present application, by comprehensively considering the average queue length and average flow rate and calculating the congestion index, the congestion degree of the transmission queue can be accurately evaluated, misjudgment can be reduced, and a foundation is laid for subsequent adjustment of the transmission queue in a congested state, and it has a strong dynamic response ability.

[0038] 102. Compare the congestion index with a preset congestion index threshold.

[0039] Among them, the preset congestion index threshold, as a preset value, is the standard for judging whether the transmission queue is in a congested state. The congestion index threshold can be adjusted according to specific application scenarios and quality of service requirements. For example, for applications with high real-time requirements, such as voice calls, the congestion index threshold can be set lower; while for applications with higher delay tolerance, such as file downloads, the congestion index threshold can be set higher.

[0040] In the embodiments of the present application, by setting the congestion index threshold and comparing the congestion index with the congestion index threshold, the system can clearly define the congestion state of the transmission queue, avoid the uncertainty brought by subjective judgment, and timely compare the congestion index with the preset congestion index threshold, so as to quickly identify when the transmission queue just enters the congested state, and the identification effect is accurate and rapid.

[0041] 103. When the congestion index is greater than or equal to the congestion index threshold, adjust the initial value of the EDCA parameters of the transmission queue, and send the data of the transmission queue based on the adjusted EDCA parameters.

[0042] Specifically, the EDCA (Enhanced Distributed Channel Access) parameters are key settings for managing and optimizing the competition for channel resources by different data streams in a wireless network. These EDCA parameters determine how each data stream accesses and uses the wireless channel to ensure that different types of data can be appropriately processed according to their priorities and quality of service requirements.

[0043] In the embodiments of the present application, when it is determined according to the comparison result that the congestion index is greater than or equal to the congestion index threshold, by quickly adjusting the EDCA parameters, giving priority to processing high-priority data, quickly alleviating the congestion situation, it can more efficiently manage channel resources, reduce the number of collisions and retransmissions, improve the overall network performance, and ensure that high-priority data can be sent first in case of congestion, improving the quality of service of real-time applications; and dynamically adjusting the EDCA parameters according to the actual congestion situation can better adapt to the changes in network load and maintain the overall stability and efficient operation of the network.

[0044] A method, apparatus, storage medium, and computer device for queue congestion control provided by the present invention first obtain the average queue length and average flow rate of a transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue. Then, the congestion index is compared with a preset congestion index threshold; when the congestion index is greater than or equal to the congestion index threshold, the initial value of the EDCA parameter of the transmission queue is adjusted, and data of the transmission queue is sent based on the adjusted EDCA parameter. By calculating the congestion index of the transmission queue, the above method can monitor and accurately identify the congestion degree of the transmission queue in real time, comprehensively and truly obtain the state of the queue, and adopt a dynamic and flexible adjustment method. When the transmission queue is in a congested state, it can timely adjust its own EDCA parameter, so that data in the high-priority queue can quickly access the channel, thereby releasing resources, alleviating congestion, effectively avoiding the impact of increased collision probability caused by adding access categories, and then significantly increasing the throughput of the wireless communication network and reducing the delay of data in the high-priority queue.

[0045] Another queue congestion control method is provided in an embodiment of the present application, as Figure 2 shown. The method includes the following steps:

[0046] 201. Calculate the congestion index.

[0047] Specifically, the average queue length and average flow rate of the transmission queue in a scheduling period are periodically obtained based on a preset time interval, and the congestion index of the transmission queue is determined based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue.

[0048] In the embodiment of the present application, the system will perform a congestion state detection every once in a while, such as every second or every minute. This preset time interval can be fixed or dynamically adjusted according to actual needs; in the present application, although a scheduling period is the basis for obtaining statistical data, the periodic check does not necessarily have to strictly follow the time length of the scheduling period. For example, the scheduling period may be from a few milliseconds to a few hundred milliseconds, while the time interval of the periodic check may be longer, such as several seconds or several minutes, to avoid the cost burden caused by overly frequent detection. By reasonably setting the scheduling period and the time interval of the periodic check, while ensuring data accuracy, the dynamic response ability and efficient operation of the system can be ensured.

[0049] Among them, the calculation formula of the congestion index is:

[0050] CI = avg Q / avg F + 0.001

[0051] Where: CI is the congestion index of the transmission queue, avg Q is the average queue length of the transmission queue in a scheduling period, avg F is the average flow rate of the transmission queue in a scheduling period.

[0052] In the embodiments of the present application, if the value of avg as the numerator Q is relatively high, it usually means that there is a large amount of data backlog in the queue, which may indicate that congestion is occurring; while if the value of avg as the denominator F is relatively high, it usually means that the system can process data quickly. On the contrary, if the value of avg F is relatively low, it may indicate that the processing speed cannot keep up with the data arrival speed, resulting in congestion; in addition, setting the parameter 0.001 can avoid the situation of division by zero when the value of avg F is zero, and can prevent the CI value from being too small and approaching zero, so as to ensure that there is a certain congestion index even at a very low flow rate.

[0053] 202. Compare the congestion index with a preset congestion index threshold.

[0054] In the embodiments of the present application, the congestion index threshold is specifically set to 2, and then the congestion index is compared with the congestion index threshold to judge the congestion state of the transmission queue. For the specific comparison process, refer to step 102, and details will not be elaborated here.

[0055] 203. When the congestion index is greater than or equal to the congestion index threshold, adjust the EDCA parameters.

[0056] Among them, the EDCA parameters of the transmission queue include: arbitration inter-frame space and random backoff window. Calculate the product of the arbitration inter-frame space in the EDCA parameters and a preset parameter, and use the product as the adjusted arbitration inter-frame space, where the preset parameter is greater than 0 and less than 1; obtain the minimum value of the random backoff window in the EDCA parameters and half of the random backoff window in the EDCA parameters, and select the minimum value of the minimum value of the random backoff window and half of the random backoff window as the adjusted random backoff window.

[0057] In one implementation, the arbitration inter-frame space AIFS in the EDCA parameters is the time interval that a node must wait after detecting that the channel is in an idle state before it can start backoff counting and attempt to send data. In the present application, the adjustment formula for the arbitration inter-frame space is as follows:

[0058] AIFS = AIFS * 0.8

[0059] In the formula, AIFS is the arbitration inter-frame space.

[0060] Specifically, by multiplying the current arbitration inter-frame space (AIFS) value by 0.8, the adjusted AIFS value is reduced by 20% compared to the initial value, shortening the time that a node needs to wait before attempting to send data, thereby increasing the speed at which high-priority data acquires channel resources, and thus reducing latency and jitter in a congested situation.

[0061] In another embodiment, the random backoff window is a key parameter that determines the range of random backoff times that a node needs to wait before attempting to send data. In this application, the adjustment formula for the random backoff window is as follows:

[0062] CW_Current = min(Cwmin, CW_Current / 2)

[0063] In the formula, CW_Current is the random backoff window, and Cwmin is the minimum random backoff window.

[0064] Specifically, divide the current random backoff window CW_Current by 2, then compare it with the minimum random backoff window Cwmin, and take the smaller value of the two as the new random backoff window CW_Current. By reducing the random backoff window CW_Current, the backoff time before each attempt by a node to send data can be reduced, thereby increasing its chance of acquiring channel resources.

[0065] 204. After the EDCA parameters are adjusted, detect the transmission status of the channel and send the data in the transmission queue based on the adjusted EDCA parameters.

[0066] Among them, when the detected transmission status of the channel is the idle state, after waiting for the arbitration inter-frame space in the EDCA parameters and passing through the random backoff window in the EDCA parameters, send the data in the transmission queue through the channel.

[0067] In the embodiments of the present application, when a node desires to send data, it first needs to detect whether the transmission state of the channel is idle. If the channel is occupied, that is, there are other nodes sending data, it will continuously detect until the channel becomes idle. Once the channel is detected to be idle, the node will not immediately start sending data but needs to wait for a specific Arbitration Inter-Frame Space (AIFS). The Arbitration Inter-Frame Space (AIFS) specifically depends on the access category to which the data belongs, and different access categories have different Arbitration Inter-Frame Space (AIFS) values. After the Arbitration Inter-Frame Space (AIFS), the node enters the backoff stage. In this stage, the node will select a random number within the range of [0, CW] as the initial value of the backoff counter and start decrementing this count value. Each time the channel remains idle, the node will decrement its backoff counter. When the backoff counter is decremented to zero, the node believes it can attempt to send data. When the backoff counter is decremented to zero and the channel still remains idle, the node will attempt to send data. If no collision occurs during the transmission, that is, no other node sends data simultaneously, the data will be successfully sent eventually. For the specific process, refer to Figure 3 , where SIFS: Short Inter-Frame Space, SIFS is the shortest inter-frame space and is used for scenarios that require quick response, such as ACK confirmation frames, data fragmentation transmission, etc.; PIFS: Point Coordination Function Inter-Frame Space, the length of PIFS is fixed and is used for contention-free transmission in the Point Coordination Function (PCF) mode, such as the base station preferentially sending management frames; DIFS: Distributed Coordination Function Inter-Frame Space, DIFS is the waiting time before standard contention access and is used for idle detection before asynchronous data transmission; AIFS: Arbitration Inter-Frame Space, AIFS is used to support the Enhanced Distributed Channel Access (EDCA) mechanism for Quality of Service (QoS). Different priorities of data, such as voice and video, can be configured with different AIFS values. The base value is DIFS, and higher priorities can be shorter; BackOff: Random Backoff. When a station is ready to send data, after the corresponding inter-frame space time, it will enter the random backoff process to further prevent collisions. The random backoff process will randomly select a value within the random backoff window for backoff; Busy Medium: Channel Busy; Contention Window: That is, the random backoff window CW, which is used as the range of values during the random backoff process; Defer Access: Deferred Access. When the channel is busy, the node does not send data temporarily but waits until the channel becomes idle and then continues to operate; Select Slot and Decrement Backoff as long as medium is idle: Select the random backoff window and decrement the backoff count when the channel is idle. When the channel is idle, the node selects the random backoff window and decrements the backoff counter until the backoff counter reaches zero and attempts to send data; Next Frame: Next Frame.

[0068] 205. When the congestion index is less than the congestion index threshold, restore the adjusted EDCA parameters to the initial values of the EDCA parameters.

[0069] In the embodiments of the present application, when the congestion index is less than the congestion index threshold, it indicates that the current transmission queue is no longer in a congested state. In this case, the system will restore the previously adjusted EDCA parameters to their initial values to ensure fairness and a normal channel access mechanism, avoid over-occupying channel resources, and maintain the stability and fairness of the system.

[0070] The present application provides another queue congestion control method, which includes first calculating the congestion index, then comparing the congestion index with a preset congestion index threshold. When the congestion index is greater than or equal to the congestion index threshold, adjust the EDCA parameters. After the EDCA parameters are adjusted, detect the sending state of the channel and send the data of the transmission queue based on the adjusted EDCA parameters; when the congestion index is less than the congestion index threshold, restore the adjusted EDCA parameters to the initial values of the EDCA parameters. For the specific process, see Figure 4 , set the initial EDCA parameters for the transmission queue, then calculate the congestion index of the transmission queue based on the average queue length and average flow rate of the transmission queue in a scheduling period, and compare it with the congestion index threshold 2. When the congestion index is greater than or equal to 2, adjust the arbitration inter-frame spacing and random backoff window in the EDCA parameters, detect the sending state of the channel, and send the data of the transmission queue based on the adjusted EDCA parameters. When the congestion index is less than 2, restore the adjusted EDCA parameters to the initial values of the EDCA parameters; the simulation results obtained by simulating using the queue congestion control method provided by the present application are as Figure 5 shown.

[0071] Further, as Figure 1 a specific implementation of the method, the embodiments of the present application provide a queue congestion control device, as Figure 6 shown, the device includes: an index calculation module 301, an index comparison module 302, and a parameter adjustment module 303.

[0072] The index calculation module 301 is configured to obtain the average queue length and average flow rate of the transmission queue in a scheduling period, and determine the congestion index of the transmission queue based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue;

[0073] The index comparison module 302 is configured to compare the congestion index with a preset congestion index threshold;

[0074] The parameter adjustment module 303 is configured to adjust the initial value of the EDCA parameters of the transmission queue when the congestion index is greater than or equal to the congestion index threshold, and send the data of the transmission queue based on the adjusted EDCA parameters.

[0075] In a specific application scenario, the exponential calculation module 301 is specifically configured to periodically obtain the average queue length and average flow rate of the transmission queue in a scheduling period based on a preset time interval.

[0076] In a specific application scenario, the calculation formula of the congestion index in the exponential calculation module 301 is: CI = avg Q / avg F + 0.001, where: CI is the congestion index of the transmission queue, avg Q is the average queue length of the transmission queue in a scheduling period, avg F is the average flow rate of the transmission queue in a scheduling period.

[0077] In a specific application scenario, the EDCA parameters of the transmission queue in the parameter adjustment module 303 include: arbitration inter-frame space and random backoff window.

[0078] In a specific application scenario, the parameter adjustment module 303 is specifically configured to calculate the product of the arbitration inter-frame space in the EDCA parameters and a preset parameter, and use the product as the adjusted arbitration inter-frame space, where the preset parameter is greater than 0 and less than 1; obtain the minimum value of the random backoff window in the EDCA parameters, and half of the random backoff window in the EDCA parameters, and select the minimum value of the minimum value of the random backoff window and half of the random backoff window as the adjusted random backoff window.

[0079] In a specific application scenario, the parameter adjustment module 303 is specifically configured to detect the sending state of the channel; when it is detected that the sending state of the channel is the idle state, wait for the arbitration inter-frame space in the EDCA parameters and then pass through the random backoff window in the EDCA parameters, and send the data of the transmission queue through the channel.

[0080] In a specific application scenario, as Figure 7 shown, the device further includes a parameter recovery module 304, and the parameter recovery module 304 is specifically configured to restore the adjusted EDCA parameters to the initial value of the EDCA parameters when the congestion index is less than the congestion index threshold.

[0081] It should be noted that for other corresponding descriptions of each functional unit involved in the queue congestion control device provided in this embodiment, reference can be made to Figure 1 and Figure 2 for the corresponding descriptions, which will not be elaborated here.

[0082] Based on the above as Figure 1 shown in the method, correspondingly, this embodiment also provides a storage medium, on which a computer program is stored, and when the program is executed by a processor, the above queue congestion control method is implemented.

[0083] Based on such an understanding, the technical solution of this application can be embodied in the form of a software product. This software product to be recognized can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the queue congestion control method in each implementation scenario of this application.

[0084] Based on the above as Figure 1 and Figure 2 shown in the method, as well as Figure 6 and Figure 7 shown in the embodiment of the queue congestion control device, in order to achieve the above purpose, as Figure 8 shown, this embodiment also provides an entity device for congestion control. This device includes a communication bus, a processor, a memory, and a communication interface, and may also include an input / output interface and a display device. Among them, each functional unit can complete mutual communication through the bus. The memory stores a computer program, and the processor is used to execute the program stored on the memory to execute the queue congestion control method in the above embodiment.

[0085] Optionally, this entity device may further include a user interface, a network interface, a camera, a Radio Frequency (RF) circuit, sensors, an audio circuit, a WI-FI module, and so on. The user interface may include a display screen (Display), an input unit such as a keyboard (Keyboard), etc. Optionally, the user interface may further include a USB interface, a card reader interface, etc. The network interface may optionally include a standard wired interface, a wireless interface (such as a WI-FI interface), etc.

[0086] Those skilled in the art can understand that the structure of an entity device for congestion control provided in this embodiment does not constitute a limitation on this entity device, and may include more or fewer components, or combine certain components, or have different component arrangements.

[0087] The storage medium may further include an operating system and a network communication module. The operating system is a program for managing the hardware and software resources to be recognized of the above entity device, and supports the operation of the information processing program and other software and / or programs to be recognized. The network communication module is used to implement communication between components inside the storage medium, as well as communication between other hardware and software in the information processing entity device.

[0088] Through the description of the above embodiments, those skilled in the art can clearly understand that the present application can be implemented by means of software plus a necessary general hardware platform, or can also be implemented by hardware. By applying the technical solution of the present application, first obtain the average queue length and average flow rate of the transmission queue in a scheduling period, determine the congestion index of the transmission queue based on the average queue length and average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue, and then compare the congestion index with a preset congestion index threshold; when the congestion index is greater than or equal to the congestion index threshold, adjust the initial value of the EDCA parameter of the transmission queue, and send the data of the transmission queue based on the adjusted EDCA parameter. The above method calculates the congestion index of the transmission queue, monitors and accurately identifies the congestion degree of the transmission queue in real time, comprehensively and truly obtains the state of the queue, and adopts a dynamic and flexible adjustment method. When the transmission queue is in a congested state, it can timely adjust its own EDCA parameters, so that the data of the high-priority queue can quickly access the channel, thereby releasing resources, alleviating congestion, effectively avoiding the impact of increasing the collision probability caused by adding access categories, and then significantly increasing the throughput of the wireless communication network and reducing the delay of the data in the high-priority queue.

[0089] Those skilled in the art can understand that the drawings are only schematic diagrams of a preferred implementation scenario, and the modules or processes in the drawings are not necessarily essential for implementing the present application. Those skilled in the art can understand that the modules in the device in the implementation scenario can be distributed in the device in the implementation scenario according to the description of the implementation scenario, or can be correspondingly changed and located in one or more devices different from the present implementation scenario. The modules in the above implementation scenario can be combined into one module, or can be further split into multiple sub-modules.

[0090] The above serial numbers of the present application are only for description and do not represent the advantages or disadvantages of the implementation scenarios. The above disclosure is only several specific implementation scenarios of the present application. However, the present application is not limited thereto, and any changes that can be thought of by those skilled in the art should fall within the protection scope of the present application.

Claims

1. A queue congestion control method, characterized in that, The method includes: Obtaining the average queue length and average flow rate of a transmission queue in a scheduling period, and determining a congestion index of the transmission queue based on the average queue length and the average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue; Comparing the congestion index with a preset congestion index threshold; When the congestion index is greater than or equal to the congestion index threshold, adjusting an initial value of EDCA parameters of the transmission queue, and sending data of the transmission queue based on the adjusted EDCA parameters.

2. The method according to claim 1, wherein The obtaining the average queue length and average flow rate of a transmission queue in a scheduling period includes: Periodically obtaining the average queue length and average flow rate of the transmission queue in a scheduling period based on a preset time interval.

3. The method according to claim 1, wherein The calculation formula of the congestion index is: CI = avg Q / avg F +0.001 Where: CI is the congestion index of the transmission queue, avg Q is the average queue length of the transmission queue in a scheduling period, avg F is the average flow rate of the transmission queue in a scheduling period.

4. The method according to claim 1, wherein The EDCA parameters of the transmission queue include: arbitration inter-frame space and random backoff window.

5. The method according to claim 1 or 4, characterized in that, The adjusting the initial value of the EDCA parameters of the transmission queue includes: Calculating a product of the arbitration inter-frame space in the EDCA parameters and a preset parameter, and using the product as the adjusted arbitration inter-frame space, where the preset parameter is greater than 0 and less than 1; Obtaining a minimum value of the random backoff window in the EDCA parameters and half of the random backoff window in the EDCA parameters, and selecting a minimum value between the minimum value of the random backoff window and half of the random backoff window as the adjusted random backoff window.

6. The method according to claim 1 or 4, characterized in that, The sending the data of the transmission queue based on the adjusted EDCA parameters includes: Detecting a sending state of a channel; When it is detected that the sending state of the channel is an idle state, waiting after the arbitration inter-frame space in the EDCA parameters and passing through the random backoff window in the EDCA parameters, and sending the data of the transmission queue through the channel.

7. The method according to claim 1, characterized in that, After the adjusting the initial value of the EDCA parameters of the transmission queue and sending the data of the transmission queue based on the adjusted EDCA parameters, the method further includes: When the congestion index is less than the congestion index threshold, restoring the adjusted EDCA parameters to the initial values of the EDCA parameters.

8. A queue congestion control device, characterized in that, The apparatus includes: An index calculation module, configured to obtain the average queue length and average flow rate of a transmission queue in a scheduling period, and determine a congestion index of the transmission queue based on the average queue length and the average flow rate, where the congestion index is used to characterize the congestion degree of the transmission queue; An index comparison module, configured to compare the congestion index with a preset congestion index threshold; A parameter adjustment module, configured to, when the congestion index is greater than or equal to the congestion index threshold, adjust an initial value of EDCA parameters of the transmission queue, and send data of the transmission queue based on the adjusted EDCA parameters.

9. A storage medium, on which a computer program is stored, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

10. A computer device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

Images