Data processing method and device based on network congestion control, equipment and medium

Abstract

The embodiment of the invention provides a data processing method and device based on network congestion control, equipment and a medium. The method comprises the following steps: acquiring to-be-sent data, and classifying the to-be-sent data according to a preset priority classification rule to obtain at least one priority type of data; determining a corresponding network congestion basic detection process according to the data, and executing the process to obtain a bandwidth delay product; determining a target priority coefficient in combination with the data priority, and calculating a target sending data volume and a target congestion window size of the corresponding data based on the coefficient, a preset fixed window size and a bandwidth delay product; data are transmitted according to this. The method is used for avoiding cache accumulation and delay jitter caused by long-term full load of a link, guaranteeing high-priority data transmission quality and improving network stability and resource allocation fairness.

Description

Technical Field

[0001] This application relates to the field of data processing, and in particular to a data processing method, apparatus, device and medium based on network congestion control. Background Technology

[0002] In dynamic environments where multiple terminals share network links, such as data centers, cloud computing platforms, and 5G networks, bandwidth resources are limited, and data traffic is characterized by burstiness, heterogeneity, and differences in service quality requirements. As a core technology for adjusting data transmission rates and ensuring network transmission stability, congestion control algorithms directly determine the overall network service quality.

[0003] Among the current mainstream congestion control algorithms, those based on bottleneck bandwidth and round-trip time (RTT) periodically measure the bottleneck bandwidth and minimum RTT of the network path, calculate the bandwidth-delay product, and then dynamically adjust the sending window and transmission rate through four stages: initiation, emptying, bandwidth probing, and delay probing, to maximize bandwidth utilization. Traditional algorithms based on packet loss signals rely on packet loss events to determine network congestion, maintaining the link operating point near the buffer overflow point. However, the former does not design differentiated strategies for the different transmission requirements of different data, while the latter has inherent defects such as high latency and sensitivity to packet loss.

[0004] Existing congestion control algorithms based on bottleneck bandwidth and round-trip time, in multi-terminal shared link scenarios, fail to prioritize data and configure differentiated parameters, leading to network links being prone to long-term full load, causing stability issues such as cache accumulation and latency jitter. At the same time, they cannot guarantee the transmission needs of high-priority data, resulting in unfair resource allocation. Summary of the Invention

[0005] This application provides a data processing method, apparatus, device, and medium based on network congestion control, which can achieve the effects of avoiding long-term full load of network links and reducing cache accumulation and latency jitter.

[0006] In a first aspect, embodiments of this application provide a data processing method based on network congestion control, including:

[0007] Get the data to be sent;

[0008] The data to be sent is classified according to a preset priority classification rule to obtain at least one priority type of data;

[0009] Based on the priority type data, determine the corresponding basic network congestion detection process;

[0010] According to the network congestion basic detection process, the corresponding priority type data is subjected to basic detection processing to obtain the bandwidth-delay product.

[0011] Based on the priority type data, determine the target priority coefficient;

[0012] Based on the target priority coefficient, the preset fixed window size, and the bandwidth-delay product, determine the target data transmission volume and the target congestion window size corresponding to the priority type data;

[0013] Send the priority type data according to the target data volume and the target congestion window size.

[0014] In one possible implementation, the data to be sent is classified according to a preset priority classification rule to obtain at least one priority type of data, including:

[0015] The data to be sent is classified according to a preset priority classification rule to obtain at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the sending priority of the first priority type data is greater than that of the second priority type data, and the sending priority of the second priority type data is greater than that of the third priority type data.

[0016] In one possible implementation, the target priority coefficient includes a first priority coefficient, a second priority coefficient, and a third priority coefficient;

[0017] Based on the target priority coefficient, the preset fixed window size, and the bandwidth-delay product, the target data transmission volume and target congestion window size corresponding to the priority type data are determined, including:

[0018] Based on the first priority coefficient and the bandwidth-delay product, determine the first target data transmission volume corresponding to the first priority type data, and based on the first target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the first target congestion window size;

[0019] Based on the second priority coefficient and the bandwidth-delay product, determine the second target data transmission volume corresponding to the second priority type data, and based on the second target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the second target congestion window size;

[0020] Based on the third priority coefficient and the bandwidth-delay product, the third target data transmission volume corresponding to the third priority type data is determined, and based on the third target data transmission volume, the bandwidth-delay product, and the preset fixed window size, the third target congestion window size is determined.

[0021] The first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient.

[0022] In one possible implementation, the formula for determining the size of the first target congestion window, based on the first target data transmission volume, the bandwidth-delay product, and the preset fixed window size, is as follows:

[0023] cwnd1=b+BDP-a1×BDP

[0024] In the formula, cwnd1 is the size of the first target congestion window, b is the preset fixed window size, a1×BDP is the amount of data sent by the first target, where a1 is the first priority coefficient, 0<a1≤1, and BDP is the bandwidth-delay product.

[0025] The formula for determining the congestion window size of the second target is as follows, based on the amount of data sent by the second target, the bandwidth-delay product, and the preset fixed window size;

[0026] cwnd2=b+BDP-a2×BDP

[0027] In the formula, cwnd2 is the size of the second target congestion window, b is the preset fixed window size, a2×BDP is the amount of data sent by the second target, where a2 is the second priority coefficient, 0<a2≤1, and BDP is the bandwidth-delay product.

[0028] The formula for determining the congestion window size of the third target, based on the amount of data transmitted by the third target, the bandwidth-delay product, and the preset fixed window size, is as follows:

[0029] cwnd3 = b + BDP - a3 × BDP

[0030] In the formula, cwnd3 is the size of the congestion window of the third target, b is the preset fixed window size, a3×BDP is the amount of data sent by the third target, where a3 is the third priority coefficient, 0<a3≤1, and BDP is the bandwidth-delay product.

[0031] In one possible implementation, the priority type data includes at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the transmission priority of the first priority type data is greater than that of the second priority type data, and the transmission priority of the second priority type data is greater than that of the third priority type data.

[0032] According to the target data volume and the target congestion window size, send the priority type data, including:

[0033] At least one priority type of data, namely the first priority type data, the second priority type data, and the third priority type data, is sent in sequence according to the target data volume and the target congestion window size.

[0034] In one possible implementation, determining the target priority coefficient based on the priority type data includes:

[0035] Based on the priority type data, a matching process is performed from a preset database to determine the priority parameter value corresponding to the priority type data as the target priority coefficient.

[0036] Alternatively, the priority type data can be displayed to allow users to view it, and a target priority coefficient can be determined in response to the user's parameter setting operation on the priority type data.

[0037] Secondly, embodiments of this application provide a data processing apparatus based on network congestion control, comprising:

[0038] The acquisition module is used to acquire data to be sent.

[0039] The classification module is used to classify the data to be sent according to a preset priority classification rule to obtain at least one priority type of data;

[0040] The detection module is used to determine the corresponding basic network congestion detection process based on the priority type data.

[0041] The detection module is also used to perform basic detection processing on the corresponding priority type data according to the network congestion basic detection process to obtain the bandwidth-delay product;

[0042] The delay detection module is used to determine the target priority coefficient based on the priority type data;

[0043] The delay detection module is also used to determine the target data transmission volume and target congestion window size corresponding to the priority type data based on the target priority coefficient, the preset fixed window size and the bandwidth-delay product;

[0044] The data sending module is also used to send the priority type data according to the target data sending volume and the target congestion window size.

[0045] In one possible implementation, the classification module is specifically used for:

[0046] The data to be sent is classified according to a preset priority classification rule to obtain at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the sending priority of the first priority type data is greater than that of the second priority type data, and the sending priority of the second priority type data is greater than that of the third priority type data.

[0047] In one possible implementation, the target priority coefficient includes a first priority coefficient, a second priority coefficient, and a third priority coefficient; the delay detection module is specifically used for:

[0048] Based on the first priority coefficient and the bandwidth-delay product, determine the first target data transmission volume corresponding to the first priority type data, and based on the first target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the first target congestion window size;

[0049] Based on the second priority coefficient and the bandwidth-delay product, determine the second target data transmission volume corresponding to the second priority type data, and based on the second target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the second target congestion window size;

[0050] Based on the third priority coefficient and the bandwidth-delay product, the third target data transmission volume corresponding to the third priority type data is determined, and based on the third target data transmission volume, the bandwidth-delay product, and the preset fixed window size, the third target congestion window size is determined.

[0051] The first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient.

[0052] In one possible implementation, the formula for determining the size of the first target congestion window, based on the first target data transmission volume, the bandwidth-delay product, and the preset fixed window size, is as follows:

[0053] cwnd1=b+BDP-a1×BDP

[0054] In the formula, cwnd1 is the size of the first target congestion window, b is the preset fixed window size, a1×BDP is the amount of data sent by the first target, where a1 is the first priority coefficient, 0<a1≤1, and BDP is the bandwidth-delay product.

[0055] The formula for determining the congestion window size of the second target is as follows, based on the amount of data sent by the second target, the bandwidth-delay product, and the preset fixed window size;

[0056] cwnd2=b+BDP-a2×BDP

[0057] In the formula, cwnd2 is the size of the second target congestion window, b is the preset fixed window size, a2×BDP is the amount of data sent by the second target, where a2 is the second priority coefficient, 0<a2≤1, and BDP is the bandwidth-delay product.

[0058] The formula for determining the congestion window size of the third target, based on the amount of data transmitted by the third target, the bandwidth-delay product, and the preset fixed window size, is as follows:

[0059] cwnd3 = b + BDP - a3 × BDP

[0060] In the formula, cwnd3 is the size of the congestion window of the third target, b is the preset fixed window size, a3×BDP is the amount of data sent by the third target, where a3 is the third priority coefficient, 0<a3≤1, and BDP is the bandwidth-delay product.

[0061] In one possible implementation, the priority type data includes at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the transmission priority of the first priority type data is higher than that of the second priority type data, and the transmission priority of the second priority type data is higher than that of the third priority type data; the data transmission module is specifically used for:

[0062] At least one priority type of data, namely the first priority type data, the second priority type data, and the third priority type data, is sent in sequence according to the target data volume and the target congestion window size.

[0063] In one possible implementation, the delay detection module is specifically used for:

[0064] Based on the priority type data, a matching process is performed from a preset database to determine the priority parameter value corresponding to the priority type data as the target priority coefficient.

[0065] Alternatively, the priority type data can be displayed to allow users to view it, and a target priority coefficient can be determined in response to the user's parameter setting operation on the priority type data.

[0066] Thirdly, embodiments of this application provide an electronic device, including: a memory and a processor;

[0067] The memory stores computer-executed instructions;

[0068] The processor executes computer execution instructions stored in the memory, causing the processor to perform the first aspect and / or various possible implementations of the first aspect as described above.

[0069] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the first aspect and / or various possible implementations of the first aspect.

[0070] Fifthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the first aspect and / or various possible implementations of the first aspect.

[0071] The data processing method, apparatus, device, and medium based on network congestion control provided in this application acquire data to be sent and prioritize it according to preset rules. Then, based on the priority, a corresponding basic network congestion detection process is determined to obtain the bandwidth-delay product. A target priority coefficient is matched according to the priority. Based on the coefficient, a preset fixed window size, and the bandwidth-delay product, a differentiated target data transmission volume and congestion window size are determined. Finally, data is sent according to this configuration. This achieves the effects of avoiding long-term full load on network links, reducing cache accumulation and latency jitter, ensuring the quality of high-priority data transmission, and improving network stability and resource allocation fairness. Attached Figure Description

[0072] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0073] Figure 1 This is a schematic diagram illustrating an application scenario of the data processing method based on network congestion control provided in the embodiments of this application.

[0074] Figure 2 A flowchart illustrating the data processing method based on network congestion control provided in this application embodiment;

[0075] Figure 3 A schematic diagram of the structure of a data processing device based on network congestion control provided in an embodiment of this application;

[0076] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application.

[0077] The accompanying drawings illustrate specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to particular embodiments. Detailed Implementation

[0078] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0079] First, let me explain the terms used in this application:

[0080] Bandwidth-Delay Product (BDP): This refers to the product of the bottleneck bandwidth of a network link and the minimum round-trip time. It reflects the maximum amount of data that a network link can carry in transit and is a core parameter for measuring the transmission capacity of a link.

[0081] Bottleneck bandwidth: refers to the bandwidth of the link with the lowest data transmission rate in a network transmission path, which determines the maximum data transmission capacity of the entire network path;

[0082] Round-trip time (RTT): refers to the total time it takes for a data packet to travel from the sender to the receiver, through the network, and then back to the sender with an acknowledgment. The minimum round-trip time is the actual propagation delay when there is no buffering or backlog in the link.

[0083] Target priority coefficient: refers to the quantization parameter matched for different priority types of data. The coefficient is positively correlated with the data transmission priority and is used to calculate the differentiated target data transmission volume and congestion window size.

[0084] Preset fixed window size: refers to the basic window value set according to the standard in the delay detection phase of the congestion control algorithm, which serves as the benchmark parameter for calculating the congestion window size;

[0085] Congestion window size (cwnd): refers to the maximum number of data packets that a sender is allowed to transmit simultaneously in the network during congestion control, used to limit the amount of data in transit to avoid network congestion;

[0086] The basic network congestion detection process refers to the link-level detection process based on the bottleneck bandwidth and round-trip time (BBR) algorithm. It includes four stages: initiation, draining, bandwidth detection, and delay detection. It is used to obtain the bottleneck bandwidth and minimum round-trip time of the link, and then calculate the bandwidth-delay product.

[0087] Priority type data: refers to data to be sent that has been divided into different levels according to a preset priority classification rule. It usually includes first (high), second (medium), and third (low) priority type data. Different types of data have different transmission priorities.

[0088] Quality of Service (QoS) refers to the standards for requirements on indicators such as latency, bandwidth, and reliability during data transmission, and is the core basis for classifying data priority types.

[0089] In existing technologies, the bandwidth-delay product of network links is periodically measured to uniformly adjust the sending window and transmission rate of all data to be sent in order to maximize bandwidth utilization. However, no differentiated congestion control parameters are configured for different types of data. This results in technical problems such as the network link being prone to being fully loaded for a long time, causing buffer accumulation, latency jitter, and failing to guarantee the quality of high-priority data transmission.

[0090] The data processing method based on network congestion control provided in this application classifies the data to be sent according to a preset priority classification rule, determines the corresponding network congestion basic detection process based on the priority to obtain the bandwidth-delay product, matches the target priority coefficient according to the priority, and determines the differentiated target data transmission volume and congestion window size based on the coefficient, the preset fixed window size and the bandwidth-delay product, and then sends the data. This solves the technical problems in the prior art that the failure to distinguish data priorities leads to long-term full load of network links, buffer accumulation, latency jitter and the inability to guarantee the quality of high-priority data transmission.

[0091] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will be described below with reference to the accompanying drawings.

[0092] Figure 1 This is a schematic diagram illustrating an application scenario of the data processing method based on network congestion control provided in the embodiments of this application, such as... Figure 1 As shown, it includes: terminal 101 and server 102.

[0093] Terminal 101 is used to provide data to be sent. Server 102 is used to receive data to be sent from the cloud, other servers, or mobile devices, and to perform data processing operations to generate priority type data.

[0094] Figure 2 This is a flowchart illustrating the data processing method based on network congestion control provided in this application embodiment. The execution entity in this embodiment can be... Figure 1 The server 102 in the illustrated embodiment can also be other computer-related devices, and this embodiment is not particularly limited.

[0095] like Figure 2 As shown, the data processing method based on network congestion control includes the following steps:

[0096] Step S201: Obtain the data to be sent.

[0097] Specifically, by obtaining the set of raw data packets to be transmitted from the transport layer of the data sender as the data to be processed, a basic data carrier is provided for subsequent differentiated congestion control operations. This provides a clear processing object for subsequent priority classification, congestion control parameter configuration, and other steps, ensuring that the entire congestion control process has executable basic data and avoiding the lack of a unified processing object for subsequent classification and parameter configuration operations due to the dispersed data sources.

[0098] Step S202: Classify the data to be sent according to the preset priority classification rules to obtain at least one priority type of data.

[0099] Specifically, based on preset rules such as network service quality (QoS) requirements and service characteristics, the system extracts core features such as protocol attributes and transmission requirement identifiers of data packets and performs feature matching to achieve preset priority division of data to be sent. By establishing the association between classification rules and subsequent parameter configuration, the system avoids the disconnect between classification operations and differential parameter adjustments, providing a classification basis for matching differentiated congestion control parameters to data with different transmission requirements. This enables data with different transmission requirements to obtain targeted resource allocation in the subsequent congestion control process, establishing a classification foundation for ensuring the quality of high-priority data transmission.

[0100] Step S203: Determine the corresponding basic network congestion detection process based on the priority type data.

[0101] Specifically, the basic network congestion detection process includes initiation, emptying, bandwidth detection, and delay detection. In the initiation phase, the transmission rate is dynamically increased to detect bottleneck bandwidth. In the emptying phase, the rate is reduced to clear the link buffer and restore the true propagation delay. In the bandwidth detection phase, the rate is fine-tuned near the bottleneck bandwidth to continuously sense bandwidth fluctuations. In the delay detection phase, the rate is periodically reduced to update the minimum round-trip time. By matching differentiated parameter triggering rules (such as the growth coefficient in the initiation phase and the gain coefficient in the bandwidth detection phase) to different priority data, the execution of the general detection process is ensured to be correlated with differentiated congestion control requirements, avoiding a disconnect between the detection process and subsequent parameter configurations. By establishing a correspondence between priority data types and the parameter triggering of the general detection process, the bandwidth detection in the initiation phase, the buffer clearing in the emptying phase, and the rate adjustment in the bandwidth detection phase can adapt to the transmission needs of data with different priorities.

[0102] Step S204: Perform basic detection processing on the corresponding priority type data according to the network congestion basic detection process to obtain the bandwidth-delay product.

[0103] Specifically, based on the measurement principles of bottleneck bandwidth (BtlBw) and minimum round-trip propagation delay (RTprop), the link status is collected through four stages: startup, emptying, bandwidth probing, and delay probing. The bandwidth-delay product (BDP = bottleneck bandwidth × minimum round-trip propagation delay) is then calculated. The bandwidth-delay product reflects the actual transmission capacity of the network link and serves as the basis for subsequent calculations of the amount of data sent for different priorities and the size of the congestion window. This avoids resource waste or network congestion caused by parameter configurations being out of sync with the actual transmission capacity of the link.

[0104] Step S205: Determine the target priority coefficient based on the priority type data.

[0105] Specifically, based on preset priority and coefficient mapping rules, or through user configuration, corresponding priority coefficients are matched for data of different priority types. The coefficient size is positively correlated with the data transmission priority. By quantifying the resource allocation weight of data with different priorities through coefficients, a quantitative correlation between data priority and resource allocation weight is established. This provides a quantifiable basis for subsequent calculation of differentiated data transmission volume and congestion window size, realizing hierarchical quantification of resource allocation weight, so that high-priority data can obtain higher resource allocation weight.

[0106] Step S206: Determine the target data transmission volume and target congestion window size corresponding to the priority type data based on the target priority coefficient, the preset fixed window size, and the bandwidth-delay product.

[0107] Specifically, based on the bandwidth-delay product, a preset fixed window size, and a target priority coefficient, a quantitative formula is used to calculate the target data transmission volume and congestion window size for data of different priorities. The physical meaning and logical relationships of each parameter in the formula are clarified, correcting the problems of disconnect between formula interpretation and calculation logic, and insufficient implementability in existing logic. Differential parameter configurations for data of different priorities are implemented, solving the problem of long-term link overload caused by uniform parameter configurations in existing technologies. This allows high-priority data to obtain parameter configurations adapted to link capabilities, while low-priority data parameter configurations avoid excessive occupation of link resources, effectively preventing the link from being in a state of long-term overload.

[0108] Step S207: Send priority type data according to the target data volume and target congestion window size.

[0109] Specifically, based on the target data transmission volume and target congestion window size, the transmission rate and in-transit data volume of different priorities are dynamically adjusted; data of different priorities can be transmitted in parallel with dynamically adjusted parameters. By implementing differentiated parameter configurations into the actual data transmission process, different priority data occupies link resources according to the appropriate parameters, solving the problem of parameter configuration being disconnected from actual transmission in existing technologies. Differential transmission of data with different priorities is achieved, ensuring the transmission quality of high-priority data, while the transmission parameters of low-priority data can avoid long-term link overload, reducing buffer accumulation and latency jitter issues.

[0110] The data processing method based on network congestion control provided in this invention classifies the data to be transmitted by priority, uniformly obtains the link-level bandwidth-delay product, and matches differentiated priority coefficients for data of different priorities. Then, it calculates and applies differentiated data transmission volume and congestion window size, breaking the existing mode of congestion control algorithms that uniformly process all data. This effectively avoids the problems of cache accumulation and latency jitter caused by long-term full load of network links, while ensuring the transmission quality of high-priority data and improving network stability and resource allocation fairness.

[0111] This embodiment provides a detailed description of the process in the above embodiment of classifying data to be sent according to a preset priority classification rule to obtain data of at least one priority type. The specific implementation of this process includes:

[0112] The data to be sent is classified according to a preset priority classification rule to obtain at least one of the following: first priority type data, second priority type data, and third priority type data. The sending priority of the first priority type data is higher than that of the second priority type data, and the sending priority of the second priority type data is higher than that of the third priority type data.

[0113] Specifically, based on network service quality requirements and service transmission characteristics, a preset priority classification rule is constructed. By extracting the core features of the data packets to be sent and matching them with the classification rule, the data is divided into first, second, and third priority types (at least one of these types is included), and the quantitative ranking relationship of different priorities is clearly defined (first priority > second priority > third priority). By establishing a hierarchical and quantifiable priority judgment standard, the problem of unreliable classification results caused by the fuzzy priority classification rules and the lack of quantitative basis for judgment standards in the existing technology is corrected. This ensures that the classification results can be effectively correlated with the subsequent differentiated congestion control parameter configuration, and avoids the disconnect between classification operations and parameter adjustments.

[0114] By providing clear and quantifiable classification criteria for matching differentiated target priority coefficients, data transmission volume, and congestion window size to data of different priorities, this addresses the problems in existing technologies where classification results cannot support differentiated resource allocation and where the feasibility of technical solutions is insufficient.

[0115] It effectively completes the hierarchical and quantifiable classification of data to be sent, clarifies the transmission priority ordering relationship of different data, avoids the lack of clear direction in subsequent parameter configuration due to ambiguity in classification rules, and enables high-priority data to obtain targeted resource configuration support in subsequent congestion control processes.

[0116] This invention establishes hierarchical and quantifiable preset priority classification rules to divide the data to be sent into first, second, and third priority types (at least one) with clear sorting relationships. This clarifies the classification basis for differentiated resource allocation and solves the problem of insufficient feasibility of existing technical solutions caused by vague priority classification judgment standards and the disconnect between classification results and parameter configuration. It lays the classification foundation for subsequent differentiated congestion control parameter configuration.

[0117] This embodiment details the process described in the above embodiment of determining the target data transmission volume and target congestion window size corresponding to priority type data based on the target priority coefficient, a preset fixed window size, and the bandwidth-delay product. The target priority coefficient includes a first priority coefficient, a second priority coefficient, and a third priority coefficient. The specific implementation of this process includes the following steps:

[0118] Step a1: Determine the first target data volume corresponding to the first priority type data based on the first priority coefficient and the bandwidth-delay product, and determine the first target congestion window size based on the first target data volume, the bandwidth-delay product, and the preset fixed window size.

[0119] Specifically, the first target data transmission volume is calculated by multiplying the first priority coefficient by the bandwidth-delay product (BDP), using the coefficient to quantify the resource occupancy weight of high-priority data; the first target congestion window size is calculated by the difference between a preset fixed window size (e.g., a value of 4, corresponding to the basic window standard in the delay detection phase of the congestion control algorithm), the bandwidth-delay product, and the first target data transmission volume, balancing the bandwidth utilization of high-priority data with the low latency requirement.

[0120] By matching the core congestion control parameters that adapt to the high transmission demand of first-priority data, the resource consumption scale and window control standard of high-priority data are clarified, and the target data transmission volume and congestion window size that adapt to the high-priority data transmission demand are output, ensuring that high-priority data can make full use of link resources while maintaining low latency characteristics.

[0121] Step a2: Determine the amount of data to be sent to the second target corresponding to the second priority type data based on the second priority coefficient and the bandwidth-delay product, and determine the size of the second target congestion window based on the amount of data to be sent to the second target, the bandwidth-delay product, and the preset fixed window size.

[0122] Specifically, the priority coefficient is positively correlated with the resource allocation weight. The amount of data sent by the second target is calculated by multiplying the second priority coefficient by the bandwidth-delay product. The coefficient value is between the first and third priority coefficients to ensure that the resource occupancy weight is adapted to the medium transmission demand. The congestion window size of the second target adopts the same calculation logic as the first priority data. It is determined by the difference between the preset fixed window size, the bandwidth-delay product and the amount of data sent by the second target, to establish a balance between link resource occupancy and other priority data transmission demands.

[0123] By providing differentiated parameter configurations between high and low priorities for second-priority data, we can prevent medium-priority data from consuming excessive link resources or failing to obtain basic resource guarantees. This allows second-priority data to obtain parameter configurations that are suitable for its medium-priority transmission needs. It will not be unable to transmit due to excessive resource squeezing by high-priority data, nor will it occupy the necessary resources of low-priority data due to aggressive parameter configuration, thereby improving the overall utilization efficiency of link resources.

[0124] Step a3: Determine the amount of data to be sent to the third target corresponding to the third priority type data based on the third priority coefficient and the bandwidth-delay product, and determine the congestion window size of the third target based on the amount of data to be sent to the third target, the bandwidth-delay product, and the preset fixed window size.

[0125] Specifically, the amount of data sent by the third target is calculated by multiplying the third priority coefficient with the smallest value by the bandwidth-delay product, thereby reducing the resource occupancy weight. When calculating the congestion window size of the third target, the product with the bandwidth-delay product is smaller because the coefficient is the smallest, resulting in a relatively larger window size. This ensures the basic transmission capacity of low-priority data while reserving link resources for high- and medium-priority data, thus solving the link full load problem caused by the lack of difference between the parameter configuration of low-priority data and high-priority data in the existing technology.

[0126] By configuring conservative resource consumption parameters for third-priority data, we can avoid excessive consumption of link resources by low-priority data, which could lead to cache accumulation. At the same time, by using a relatively reasonable window size, we can ensure its basic transmission needs and achieve reasonable resource consumption for low-priority data. This ensures that it can complete basic transmission tasks without causing the link to be overloaded for a long time due to aggressive parameter configuration, thereby reducing the impact on the data transmission quality of high and medium priority data and improving the stability of network transmission.

[0127] Step a4: where the first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient.

[0128] Specifically, by establishing a quantitative ranking relationship of priority coefficients, the magnitude of the coefficients directly maps the priority weight of data in the competition for link resources. This provides a unified coefficient ranking basis for parameter calculation of data with different priorities, ensuring that the coefficient advantage of high-priority data can be transformed into a resource occupation advantage, and realizing differentiated resource allocation. The difference in priority coefficients forms a clear resource allocation guide, avoiding the lack of substantial difference in parameter configuration of data with different priorities due to ambiguous coefficient ranking. This ensures that high-priority data receives clear resource tilt in the parameter calculation stage, solving the problem of the disconnect between priority classification and resource allocation in existing technologies.

[0129] This invention establishes a clear ranking relationship between first, second, and third priority coefficients, and combines the bandwidth-delay product with a preset fixed window size to calculate differentiated target data transmission volume and congestion window size for different priority data types. This solves the problems of lack of quantitative basis for parameter calculation, disconnect between priority and resource allocation, and insufficient feasibility of technical solutions in the prior art. It enables link resources to be tilted towards high-priority data while ensuring the basic transmission needs of medium and low-priority data, thereby improving the fairness of network resource allocation and transmission stability.

[0130] In some optional implementations, the formula for determining the size of the first target congestion window, based on the amount of data sent by the first target, the bandwidth-delay product, and a preset fixed window size, is as follows:

[0131] cwnd1=b+BDP-a1×BDP

[0132] In the formula, cwnd1 is the size of the first target congestion window, b is the preset fixed window size, a1×BDP is the amount of data sent by the first target, where a1 is the first priority coefficient, 0<a1≤1, and BDP is the bandwidth-delay product.

[0133] The formula for calculating the congestion window size of the second target is as follows, based on the amount of data sent by the second target, the bandwidth-delay product, and the preset fixed window size;

[0134] cwnd2=b+BDP-a2×BDP

[0135] In the formula, cwnd2 is the size of the second target congestion window, b is the preset fixed window size, a2×BDP is the amount of data sent by the second target, where a2 is the second priority coefficient, 0<a2≤1, and BDP is the bandwidth-delay product.

[0136] The formula for determining the congestion window size of the third target, based on the product of the data volume sent by the third target and the bandwidth delay, and the preset fixed window size, is as follows:

[0137] cwnd3 = b + BDP - a3 × BDP

[0138] In the formula, cwnd3 is the size of the congestion window of the third target, b is the preset fixed window size, a3×BDP is the amount of data sent by the third target, where a3 is the third priority coefficient, 0<a3≤1, and BDP is the bandwidth-delay product.

[0139] Specifically, a fixed window size 'b' is preset, for example, 4 (corresponding to the standard base window in the delay detection phase of the bottleneck bandwidth and round-trip time (BBR) algorithm). The bandwidth-delay product, as a core indicator reflecting the maximum transmission capacity of the link, directly determines the upper limit of the amount of data in transit that the link can carry. The product of the priority coefficient 'a' and BDP explicitly corresponds to the target data transmission volume for each priority level, with 'a' being less than or equal to 1. The formula, through the calculation of the base window and the link capacity redundancy (i.e., adding the difference between 'b' and BDP minus the target data transmission volume), achieves a precise match between the congestion window size and data priority, as well as the actual transmission capacity of the link, solving the problems of ambiguous formula parameters and disconnect between calculation logic and link characteristics in existing technologies. Based on the sorting rule that the first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient, it ensures that the window calculation for high-priority data is more aligned with low-latency requirements, while the window calculation for low-priority data focuses more on resource reservation, forming a quantitative calculation logic that matches the priority.

[0140] By transforming abstract priority requirements into concrete, computable congestion window parameters, differentiated window configuration standards are provided for data of different priorities. This solves the problem in existing technologies where window parameter configuration lacks quantitative basis and cannot adapt to different data transmission needs. It also provides clear support for the low latency requirements of high-priority data and the rationality of resource consumption of low-priority data through formula calculation.

[0141] By quantitatively calculating and outputting congestion window sizes adapted to different data priorities: high-priority data, due to its larger priority coefficient, has a window size closer to the base window b, ensuring low-latency transmission; low-priority data, due to its smaller priority coefficient, has a significantly larger window size supplemented by link capacity redundancy, ensuring basic transmission capacity while avoiding excessive occupation of link resources. This effectively solves the problems of increased latency for high-priority data and wasted resources for low-priority data caused by traditional fixed windows, enabling a precise match between congestion window parameters and actual link transmission capacity and data transmission requirements, improving the feasibility and effectiveness of parameter configuration.

[0142] This invention, through the construction of a quantitative calculation formula that integrates a preset fixed window size, bandwidth-delay product, and priority coefficient, transforms data priority requirements and link transmission capabilities into specific congestion window parameters. This solves the problems of ambiguous congestion window configuration parameters and the disconnect between calculation logic and actual needs in existing systems. It enables differentiated and precise configuration of congestion windows for data of different priorities, optimizes link resource utilization efficiency while ensuring the quality of high-priority data transmission, and improves the stability and rationality of network congestion control.

[0143] This embodiment provides a detailed description of the process of sending priority type data according to the target data volume and target congestion window size in the above embodiments. The priority type data includes at least one of first priority type data, second priority type data, and third priority type data, wherein the sending priority of the first priority type data is higher than that of the second priority type data, and the sending priority of the second priority type data is higher than that of the third priority type data. The specific implementation of this process includes:

[0144] Data of at least one priority type, namely first priority type data, second priority type data, and third priority type data, are sent in sequence according to the target data volume and target congestion window size.

[0145] Specifically, the resource allocation priority mechanism based on network service quality, combined with dynamic rate control based on bottleneck bandwidth and round-trip time algorithms, ensures that within the same transmission cycle, data of the first priority type receives priority access to link bandwidth allocation. Data of the second and third priority types occupy the remaining resources according to their respective target data transmission volume and congestion window size, provided that the high-priority data transmission needs are met.

[0146] By transforming priority sorting into executable resource allocation rules, high-priority data is given priority in link resource allocation, ensuring that its target data transmission volume and congestion window size can be realized first; the resource occupation boundaries of medium and low-priority data are clearly defined, enabling it to achieve efficient transmission based on its own parameter configuration without interfering with high-priority data, and avoiding long-term blocking of medium and low-priority data due to serial transmission.

[0147] High-priority data, due to its priority in resource allocation, has its transmission needs (such as low latency) guaranteed through priority bandwidth allocation, preventing it from being crowded out by low- and medium-priority data. Low- and medium-priority data, relying on their own target data volume and congestion window size, achieve effective transmission during periods of link resource idleness, avoiding meaningless delays caused by waiting for high-priority data to complete. Simultaneously, this avoids low link bandwidth utilization due to serial logic, translating the effects of differentiated parameter configuration into actual improvements in transmission quality.

[0148] This invention achieves differentiated resource allocation by using the target data volume and congestion window size for each priority level. This solves the problems of conflict between the original logic's sending rules and the network's parallel transmission characteristics, as well as the lack of feasibility of the technical solution. While ensuring the data transmission quality of the first priority type, it ensures that the medium and low priority types of data receive reasonable transmission resources, thereby improving the overall utilization efficiency and transmission stability of the network link.

[0149] This embodiment provides a detailed description of the process for determining the target priority coefficient based on priority type data in the above embodiments. The specific implementation of this process includes:

[0150] Based on the priority type data, a matching process is performed from the preset database to determine the priority parameter value corresponding to the priority type data as the target priority coefficient.

[0151] Alternatively, the data can be displayed based on priority type data for users to view, and the target priority coefficient can be determined in response to user parameter settings for priority type data.

[0152] Specifically, a standardized mapping relationship between priority types and priority coefficients is stored in the pre-defined database. This mapping relationship is constructed based on network service quality requirements, business transmission characteristics, and historical optimization data. By extracting the core identifiers of priority type data (such as priority level labels), a precise match is achieved with the pre-defined key-value pairs in the database. This transforms the abstract priority classification into quantifiable coefficient parameters, ensuring that the matching process is supported by traceable rules.

[0153] This method automates the determination of target priority coefficients, avoiding inefficiencies and parameter inconsistencies caused by manual intervention. It also leverages pre-defined standardized mapping relationships in the database to provide a unified coefficient matching benchmark for data of different priority types, addressing the issues of incomplete technical features and insufficient feasibility in the coefficient determination process of previous technologies. This ensures the efficiency and consistency of the coefficient determination process, avoiding coefficient deviations caused by fuzzy matching rules, and providing accurate and reliable quantitative basis for subsequent calculation of differentiated parameters.

[0154] Based on the data display interface and parameter configuration response mechanism, the categorized priority type data is presented in a structured form, while providing a configuration entry that conforms to the parameter value range (adapted to the priority coefficient sorting rules mentioned above). By acquiring the user's parameter input operations and completing the legality verification (ensuring that the first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient), the target priority coefficient is finally determined. Based on automated matching, manual intervention is supplemented to solve the technical defects that the preset database cannot cover special scenario requirements.

[0155] This solution addresses the limitations of preset database matching methods in specific business scenarios by providing users with an intervention point for parameter configuration. This ensures that target priority coefficients align with specific network environments and business needs, enhancing the scenario adaptability of the technical solution. It enables personalized configuration of target priority coefficients, ensuring accurate matching of coefficients to actual needs in scenarios not covered by preset rules. Furthermore, it uses validity checks to guarantee that parameter configurations conform to the overall priority sorting logic, avoiding parameter conflicts caused by manual operations and improving the flexibility and reliability of coefficient determination.

[0156] This invention provides an automated method for matching preset databases and a flexible method for user interaction configuration. By combining clear priority coefficient matching rules and a legality verification mechanism, it solves the problems of vague target priority coefficient determination standards, incomplete technical features, and insufficient feasibility in the prior art. It ensures both the efficiency and consistency of coefficient determination in conventional scenarios and meets the personalized needs in special scenarios, providing accurate and reliable quantitative support for subsequent calculation of differentiated congestion control parameters.

[0157] Figure 3 This is a schematic diagram of the structure of a data processing device based on network congestion control provided in an embodiment of this application. Figure 3 As shown, the data processing device 30 based on network congestion control includes:

[0158] The acquisition module 301 is used to acquire the data to be sent.

[0159] The classification module 302 is used to classify the data to be sent according to a preset priority classification rule to obtain at least one priority type of data.

[0160] The detection module 303 is used to determine the corresponding basic network congestion detection process based on priority type data.

[0161] The detection module 303 is also used to perform basic detection processing on the corresponding priority type data according to the basic network congestion detection process to obtain the bandwidth-delay product.

[0162] The delay detection module 304 is used to determine the target priority coefficient based on priority type data.

[0163] The delay detection module 304 is also used to determine the target data transmission volume and target congestion window size corresponding to the priority type data based on the target priority coefficient, the preset fixed window size and the bandwidth delay product.

[0164] The data sending module 305 is also used to send priority type data according to the target data sending volume and the target congestion window size.

[0165] In one possible implementation, the classification module 302 is specifically used for:

[0166] The data to be sent is classified according to a preset priority classification rule to obtain at least one of the following: first priority type data, second priority type data, and third priority type data. The sending priority of the first priority type data is higher than that of the second priority type data, and the sending priority of the second priority type data is higher than that of the third priority type data.

[0167] In one possible implementation, the target priority coefficient includes a first priority coefficient, a second priority coefficient, and a third priority coefficient. The delay detection module 304 is specifically used for:

[0168] Based on the first priority coefficient and the bandwidth-delay product, determine the first target data volume corresponding to the first priority type data, and determine the first target congestion window size based on the first target data volume, the bandwidth-delay product, and the preset fixed window size.

[0169] Based on the second priority coefficient and the bandwidth-delay product, determine the second target data volume corresponding to the second priority type data, and determine the second target congestion window size based on the second target data volume, the bandwidth-delay product, and the preset fixed window size.

[0170] Based on the third priority coefficient and the bandwidth-delay product, determine the amount of third target data to be sent corresponding to the third priority type data, and determine the third target congestion window size based on the amount of third target data to be sent, the bandwidth-delay product, and the preset fixed window size.

[0171] The first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient.

[0172] In one possible implementation, the formula for determining the size of the first target congestion window, based on the amount of data sent by the first target, the bandwidth-delay product, and a preset fixed window size, is as follows:

[0173] cwnd1=b+BDP-a1×BDP

[0174] In the formula, cwnd1 is the size of the first target congestion window, b is the preset fixed window size, a1×BDP is the amount of data sent by the first target, where a1 is the first priority coefficient, 0<a1≤1, and BDP is the bandwidth-delay product.

[0175] The formula for calculating the congestion window size of the second target is as follows, based on the amount of data sent by the second target, the bandwidth-delay product, and the preset fixed window size.

[0176] cwnd2=b+BDP-a2×BDP

[0177] In the formula, cwnd2 is the size of the second target congestion window, b is the preset fixed window size, a2×BDP is the amount of data sent by the second target, where a2 is the second priority coefficient, 0<a2≤1, and BDP is the bandwidth-delay product.

[0178] The formula for determining the congestion window size of the third target, based on the product of the data volume sent by the third target and the bandwidth delay, and the preset fixed window size, is as follows:

[0179] cwnd3 = b + BDP - a3 × BDP

[0180] In the formula, cwnd3 is the size of the congestion window of the third target, b is the preset fixed window size, a3×BDP is the amount of data sent by the third target, where a3 is the third priority coefficient, 0<a3≤1, and BDP is the bandwidth-delay product.

[0181] In one possible implementation, the priority type data includes at least one of first priority type data, second priority type data, and third priority type data, wherein the transmission priority of the first priority type data is higher than that of the second priority type data, and the transmission priority of the second priority type data is higher than that of the third priority type data. The data transmission module 305 is specifically used for:

[0182] Data of at least one priority type, namely first priority type data, second priority type data, and third priority type data, are sent in sequence according to the target data volume and target congestion window size.

[0183] In one possible implementation, the delay detection module 304 is specifically used for:

[0184] Based on the priority type data, a matching process is performed from the preset database to determine the priority parameter value corresponding to the priority type data as the target priority coefficient.

[0185] Alternatively, the data can be displayed based on priority type data for users to view, and the target priority coefficient can be determined in response to user parameter settings for priority type data.

[0186] The data processing device based on network congestion control provided in this embodiment can be used to execute the above-described data processing method based on network congestion control. Its implementation principle and technical effect are similar, and will not be described again in this embodiment.

[0187] Figure 4 A schematic diagram of the hardware structure of the electronic device provided in the embodiments of this application, such as... Figure 4 As shown, the electronic device 40 includes at least one processor 401 and a memory 402. Optionally, the electronic device 40 also includes a communication component 403. The processor 401, memory 402, and communication component 403 are connected via a bus 404.

[0188] In the specific implementation process, at least one processor 401 executes computer execution instructions stored in memory 402, causing at least one processor 401 to perform the above method.

[0189] The specific implementation process of processor 401 can be found in the above method embodiments, and its implementation principle and technical effect are similar. It will not be repeated here.

[0190] In the above embodiments, it should be understood that the processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this invention can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules within the processor.

[0191] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage device.

[0192] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, the buses shown in the accompanying drawings are not limited to a single bus or a single type of bus.

[0193] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.

[0194] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above-described method.

[0195] The aforementioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. The readable storage medium can be any available medium accessible to a general-purpose or special-purpose computer.

[0196] An exemplary readable storage medium is coupled to a processor, enabling the processor to read information from and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can reside in an Application Specific Integrated Circuit (ASIC). Alternatively, the processor and the readable storage medium can exist as discrete components in the device.

[0197] The division of units is merely a logical functional division; in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.

[0198] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0199] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0200] If a function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0201] Those skilled in the art will understand that all or part of the steps of the above-described method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When executed, the program performs the steps of the above-described method embodiments; and the aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.

[0202] Finally, it should be noted that other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein, and is not limited to the precise structures described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.

Claims

1. A data processing method based on network congestion control, characterized in that, include: Get the data to be sent; The data to be sent is classified according to a preset priority classification rule to obtain at least one priority type of data; Based on the priority type data, determine the corresponding basic network congestion detection process; According to the network congestion basic detection process, the corresponding priority type data is subjected to basic detection processing to obtain the bandwidth-delay product. Based on the priority type data, determine the target priority coefficient; Based on the target priority coefficient, the preset fixed window size, and the bandwidth-delay product, determine the target data transmission volume and the target congestion window size corresponding to the priority type data; Send the priority type data according to the target data volume and the target congestion window size.

2. The method according to claim 1, characterized in that, The data to be sent is classified according to a preset priority classification rule to obtain at least one priority type of data, including: The data to be sent is classified according to a preset priority classification rule to obtain at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the sending priority of the first priority type data is greater than that of the second priority type data, and the sending priority of the second priority type data is greater than that of the third priority type data.

3. The method according to claim 2, characterized in that, The target priority coefficient includes a first priority coefficient, a second priority coefficient, and a third priority coefficient; based on the target priority coefficient, a preset fixed window size, and the bandwidth-delay product, the target data transmission volume and the target congestion window size corresponding to the priority type data are determined, including: Based on the first priority coefficient and the bandwidth-delay product, determine the first target data transmission volume corresponding to the first priority type data, and based on the first target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the first target congestion window size; Based on the second priority coefficient and the bandwidth-delay product, determine the second target data transmission volume corresponding to the second priority type data, and based on the second target data transmission volume, the bandwidth-delay product and the preset fixed window size, determine the second target congestion window size; Based on the third priority coefficient and the bandwidth-delay product, the third target data transmission volume corresponding to the third priority type data is determined, and based on the third target data transmission volume, the bandwidth-delay product, and the preset fixed window size, the third target congestion window size is determined. The first priority coefficient is greater than the second priority coefficient, and the second priority coefficient is greater than the third priority coefficient.

4. The method according to claim 3, characterized in that, The formula for determining the size of the first target congestion window, based on the amount of data sent by the first target, the bandwidth-delay product, and the preset fixed window size, is as follows: cwnd1=b+BDP-a1×BDP In the formula, cwnd1 is the size of the first target congestion window, b is the preset fixed window size, a1×BDP is the amount of data sent by the first target, where a1 is the first priority coefficient, 0<a1≤1, and BDP is the bandwidth-delay product. The formula for determining the congestion window size of the second target is as follows, based on the amount of data sent by the second target, the bandwidth-delay product, and the preset fixed window size; cwnd2=b+BDP-a2×BDP In the formula, cwnd2 is the size of the second target congestion window, b is the preset fixed window size, a2×BDP is the amount of data sent by the second target, where a2 is the second priority coefficient, 0<a2≤1, and BDP is the bandwidth-delay product. The formula for determining the congestion window size of the third target, based on the amount of data transmitted by the third target, the bandwidth-delay product, and the preset fixed window size, is as follows: cwnd3 = b + BDP - a3 × BDP In the formula, cwnd3 is the size of the congestion window of the third target, b is the preset fixed window size, a3×BDP is the amount of data sent by the third target, where a3 is the third priority coefficient, 0<a3≤1, and BDP is the bandwidth-delay product.

5. The method according to claim 1, characterized in that, The priority type data includes at least one of a first priority type data, a second priority type data, and a third priority type data, wherein the transmission priority of the first priority type data is greater than that of the second priority type data, and the transmission priority of the second priority type data is greater than that of the third priority type data. According to the target data volume and the target congestion window size, send the priority type data, including: At least one priority type of data, namely the first priority type data, the second priority type data, and the third priority type data, is sent in sequence according to the target data volume and the target congestion window size.

6. The method according to claim 1, characterized in that, Based on the priority type data, determine the target priority coefficient, including: Based on the priority type data, a matching process is performed from a preset database to determine the priority parameter value corresponding to the priority type data as the target priority coefficient. Alternatively, the priority type data can be displayed for the user to view, and a target priority coefficient can be determined in response to the user's parameter setting operation on the priority type data.

7. A data processing device based on network congestion control, characterized in that, include: The acquisition module is used to acquire data to be sent. The classification module is used to classify the data to be sent according to a preset priority classification rule to obtain at least one priority type of data; The detection module is used to determine the corresponding basic network congestion detection process based on the priority type data. The detection module is also used to perform basic detection processing on the corresponding priority type data according to the network congestion basic detection process to obtain the bandwidth-delay product; The delay detection module is used to determine the target priority coefficient based on the priority type data; The delay detection module is also used to determine the target data transmission volume and target congestion window size corresponding to the priority type data based on the target priority coefficient, the preset fixed window size and the bandwidth-delay product; The data sending module is also used to send the priority type data according to the target data sending volume and the target congestion window size.

8. An electronic device, characterized in that, include: Memory, processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory, causing the processor to perform the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method described in any one of claims 1 to 6.

Images