Link delay detection method, device, equipment, medium and program product
By detecting the basic link delay and real-time bottleneck bandwidth and dynamically selecting the target congestion window value, the problem of low link delay detection efficiency in the existing technology is solved, and more efficient link delay detection and network resource optimization are achieved.
Patent Information
- Application Number
- CN202510926573.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-07-04
- Publication Date
- 2025-09-19
AI Technical Summary
In the existing link delay detection technology, the actual propagation delay is measured by reducing the congestion window to 4 data packets, which leads to reduced transmission performance and low detection efficiency.
By detecting the basic round-trip propagation time and real-time bottleneck bandwidth of the link, multiple preset congestion window values are obtained. The target congestion window value is dynamically selected using the judgment coefficient threshold and cache clearing mechanism to achieve link delay detection.
It improves the accuracy and efficiency of link delay detection, avoids data accumulation, and optimizes network resource utilization.
Smart Images
Figure CN120675909A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer network and communication technology, and in particular to a link delay detection method, device, equipment, medium and program product. Background Art
[0002] Bottleneck Bandwidth and Round-trip Propagation Time (BBR) is a network congestion control algorithm designed to optimize network data transmission performance. It dynamically adjusts the data transmission rate by accurately measuring the bottleneck bandwidth (i.e., the bandwidth of the slowest link in the path) and the round-trip propagation time (RTT), the time it takes for a data packet to travel from the sender to the receiver and back. Therefore, developing more efficient link delay detection methods has become a promising area of research to more accurately perceive the actual network transmission capacity and dynamically adjust the send window size and transmission rate based on real-time measurement results, thereby effectively avoiding network congestion and maximizing network bandwidth utilization.
[0003] In existing technologies, link delay detection methods mainly optimize transmission efficiency, avoid congestion, and maximize bandwidth utilization by actively detecting network status. Their operating point is located near the pipe capacity (BDP) with the largest bandwidth and lowest latency, and includes four stages: startup, draining, bandwidth detection, and delay detection to adapt to network changes.
[0004] However, existing technologies reduce the congestion window (cwnd) to 4 data packets during the Probe RTT phase to measure the actual propagation delay. However, this operation strictly limits the sending of service data, resulting in a degradation of transmission performance, thus posing a technical problem of low link delay detection efficiency. Summary of the Invention
[0005] The link delay detection method, device, equipment, medium and program product provided in this application are used to achieve the technical effect of improving the efficiency of link delay detection.
[0006] In a first aspect, the present application provides a link delay detection method, comprising:
[0007] In response to the start of delay detection of the link to be detected, detecting a basic round trip propagation time of the link to be detected;
[0008] Detecting a first real-time bottleneck bandwidth of a link to be detected;
[0009] Acquire multiple preset congestion window values; wherein the largest one among the multiple preset congestion window values is a first congestion window value;
[0010] Performing a first delay detection on the link to be detected according to the first congestion window value to obtain a first delay bottleneck bandwidth;
[0011] According to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth, a target congestion window value for link delay detection is determined from a plurality of preset congestion window values.
[0012] In one possible implementation, determining a target congestion window value for link delay detection from a plurality of preset congestion window values based on the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth includes:
[0013] Obtaining a preset judgment coefficient threshold;
[0014] Calculating a first difference between a first delayed bottleneck bandwidth and a first real-time bottleneck bandwidth;
[0015] Calculating a ratio of the first difference to the first real-time bottleneck bandwidth;
[0016] Comparing the ratio with a preset judgment coefficient threshold to determine a comparison result;
[0017] According to the comparison result, a target congestion window value for link delay detection is determined from a plurality of preset congestion window values.
[0018] In a possible implementation, determining a target congestion window value for link delay detection from a plurality of preset congestion window values according to the comparison result includes:
[0019] If the comparison result is that the ratio is smaller than the preset judgment coefficient threshold, the first congestion window value is determined as the target congestion window value.
[0020] In a possible implementation, the multiple preset congestion window values further include a preset minimum congestion window value, a second congestion window value, and a third congestion window value; the preset minimum congestion window value is smaller than the second congestion window value, and the second congestion window value is smaller than the third congestion window value;
[0021] Accordingly, according to the comparison result, a target congestion window value for link delay detection is determined from a plurality of preset congestion window values, including:
[0022] If the comparison result is that the ratio is not less than the preset judgment coefficient threshold, one of the preset minimum congestion window value, the second congestion window value, and the third congestion window value is determined as the target congestion window value.
[0023] In a possible implementation, determining one of a preset minimum congestion window value and a plurality of second congestion window values as a target congestion window value includes:
[0024] According to the preset minimum congestion window value, the network path cache of the link to be detected is cleared;
[0025] After the network path cache is cleared, detecting the second real-time bottleneck bandwidth of the link to be detected;
[0026] Performing a second delay detection on the link to be detected according to the second congestion window value to obtain a second delay bottleneck bandwidth;
[0027] According to the second real-time bottleneck bandwidth and the second delay bottleneck bandwidth, it is determined whether to determine the second congestion window value as the target congestion window value.
[0028] In a possible implementation, after determining whether to determine the second congestion window value as the target congestion window value according to the second real-time bottleneck bandwidth and the second delay bottleneck bandwidth, the method further includes:
[0029] If it is determined that the second congestion window value is not to be determined as the target congestion window value, then performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0030] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0031] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0032] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0033] In a possible implementation manner, after determining whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, the method further includes:
[0034] If it is determined that the third congestion window value is not to be determined as the target congestion window value, performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0035] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0036] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0037] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0038] In a possible implementation manner, after determining whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, the method further includes:
[0039] If it is determined not to determine the third congestion window value as the target congestion window value, it is determined to determine the preset minimum congestion window value as the target congestion window value.
[0040] In one possible implementation, after determining a target congestion window value for link delay detection from a plurality of preset congestion window values based on the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth, the method further includes:
[0041] According to the target congestion window value, a delay detection is performed on the link to be detected.
[0042] In a second aspect, the present application provides a link delay detection device, comprising:
[0043] A first detection module is configured to detect a basic round trip propagation time of a link to be detected in response to the start of delay detection of the link to be detected;
[0044] A second detection module is used to detect a first real-time bottleneck bandwidth of the link to be detected;
[0045] An acquisition module, configured to acquire a plurality of preset congestion window values; wherein the largest one among the plurality of preset congestion window values is a first congestion window value;
[0046] a detection module, configured to perform a first delay detection on the link to be detected according to the first congestion window value, so as to obtain a first delay bottleneck bandwidth;
[0047] The determination module is configured to determine a target congestion window value for link delay detection from a plurality of preset congestion window values according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth.
[0048] In a possible implementation, the determination module is further configured to:
[0049] Obtaining a preset judgment coefficient threshold;
[0050] Calculating a first difference between a first delayed bottleneck bandwidth and a first real-time bottleneck bandwidth;
[0051] Calculating a ratio of the first difference to the first real-time bottleneck bandwidth;
[0052] Comparing the ratio with a preset judgment coefficient threshold to determine a comparison result;
[0053] According to the comparison result, a target congestion window value for link delay detection is determined from a plurality of preset congestion window values.
[0054] In a possible implementation, the determination module is further configured to:
[0055] If the comparison result is that the ratio is smaller than the preset judgment coefficient threshold, the first congestion window value is determined as the target congestion window value.
[0056] In a possible implementation, the multiple preset congestion window values further include a preset minimum congestion window value, a second congestion window value, and a third congestion window value; the preset minimum congestion window value is smaller than the second congestion window value, and the second congestion window value is smaller than the third congestion window value;
[0057] Accordingly, the determination module is also used to:
[0058] If the comparison result is that the ratio is not less than the preset judgment coefficient threshold, one of the preset minimum congestion window value, the second congestion window value, and the third congestion window value is determined as the target congestion window value.
[0059] In a possible implementation, the determination module is further configured to:
[0060] According to the preset minimum congestion window value, the network path cache of the link to be detected is cleared;
[0061] After the network path cache is cleared, detecting the second real-time bottleneck bandwidth of the link to be detected;
[0062] Performing a second delay detection on the link to be detected according to the second congestion window value to obtain a second delay bottleneck bandwidth;
[0063] According to the second real-time bottleneck bandwidth and the second delay bottleneck bandwidth, it is determined whether to determine the second congestion window value as the target congestion window value.
[0064] In a possible implementation, the determination module is further configured to:
[0065] If it is determined that the second congestion window value is not to be determined as the target congestion window value, then performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0066] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0067] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0068] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0069] In a possible implementation, the determination module is further configured to:
[0070] If it is determined that the third congestion window value is not to be determined as the target congestion window value, performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0071] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0072] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0073] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0074] In a possible implementation, the determination module is further configured to:
[0075] If it is determined not to determine the third congestion window value as the target congestion window value, it is determined to determine the preset minimum congestion window value as the target congestion window value.
[0076] In a possible implementation, the determination module is further configured to:
[0077] According to the target congestion window value, a delay detection is performed on the link to be detected.
[0078] In a third aspect, the present application provides a link delay detection device, comprising: a memory, a processor;
[0079] Memory stores computer-executable instructions;
[0080] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the above first aspect and / or various possible implementations of the first aspect.
[0081] In a fourth aspect, the present application provides a computer-readable storage medium, which stores computer-executable instructions. When the computer-executable instructions are executed by a processor, they are used to implement the above first aspect and / or various possible implementation methods of the first aspect.
[0082] In a fifth aspect, the present application provides a computer program product, comprising a computer program, which, when executed by a processor, implements the above first aspect and / or various possible implementations of the first aspect.
[0083] The present application provides a link delay detection method, apparatus, device, medium, and program product. First, by obtaining the basic link delay characteristics, a benchmark is provided for detection. Second, the upper limit of the link's real-time transmission capacity is captured to reflect the current network status. Then, different sending window values are preset to provide parameters for subsequent comparison. At the same time, the maximum window is used to evaluate the delay impact under high traffic. Finally, by integrating real-time bandwidth and delay data, an optimal sending window is selected that can accurately reflect the link delay characteristics while avoiding data accumulation, thereby achieving the technical effect of improving the efficiency of link delay detection. BRIEF DESCRIPTION OF THE DRAWINGS
[0084] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0085] Figure 1 A schematic diagram of an application data processing system architecture provided in an embodiment of the present application;
[0086] Figure 2 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 1 ;
[0087] Figure 3 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 2 ;
[0088] Figure 4 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 3 ;
[0089] Figure 5 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 4 ;
[0090] Figure 6 A schematic diagram of the structure of a link delay detection device provided in an embodiment of the present application;
[0091] Figure 7 A schematic diagram of the structure of the link delay detection device provided in an embodiment of the present application.
[0092] The above drawings illustrate specific embodiments of the present application, which will be described in more detail below. These drawings and the textual description are not intended to limit the scope of the present application in any way, but rather to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments. DETAILED DESCRIPTION
[0093] Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, identical numerals in different figures represent identical or similar elements, unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
[0094] Because the existing technology reduces cwnd to 4 data packets in the Probe RTT stage to measure the actual propagation delay, but this operation strictly limits the sending of business data, resulting in a decrease in transmission performance, there is a technical problem of low link delay detection efficiency.
[0095] In response to the above problems, the present application provides a link delay detection method, device, equipment, medium and program product. First, by obtaining the basic delay characteristics of the link, a benchmark is provided for detection; secondly, the upper limit of the link's real-time transmission capacity is captured to reflect the current network status; then, different sending window values are preset to provide parameters for subsequent comparison; at the same time, the maximum window is used to evaluate the delay impact under large traffic; finally, the real-time bandwidth and delay data are integrated to screen out the optimal sending window that can accurately reflect the link delay characteristics and avoid data accumulation, thereby achieving the technical effect of improving the efficiency of link delay detection.
[0096] The following specific embodiments describe in detail the technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.
[0097] Figure 1 This is a schematic diagram of an application data processing system architecture provided in an embodiment of the present application. The application data processing system is a computer device. Figure 1 As shown, the above architecture includes at least one of a data acquisition device 101 , a processing device 102 and a display device 103 .
[0098] It is understood that the structure illustrated in the embodiments of this application does not constitute a specific limitation on the architecture of the application data processing system. In other feasible implementations of this application, the above architecture may include more or fewer components than shown, or combine or split certain components, or arrange the components differently. The specific configuration can be determined based on the actual application scenario and is not limited here. Figure 1 The components shown can be implemented in hardware, software, or a combination of software and hardware.
[0099] In a specific implementation process, the data acquisition device 101 may include an input / output interface and may also include a communication interface. The data acquisition device 101 may be connected to the processing device via the input / output interface or the communication interface.
[0100] The processing device 102 can first measure the basic propagation delay of the link as a reference benchmark, and simultaneously capture the real-time transmission capacity upper limit of the current link; then, by presetting sending window parameters of different sizes, especially simulating high-load scenarios with the maximum window, observe the delay variation pattern under different sending intensities; finally, comprehensively consider the actual carrying capacity of the link and the delay performance under large traffic impact, and screen out the optimal sending window configuration that can truly reflect the network transmission characteristics and avoid data accumulation, thereby reducing the occupation of network resources while ensuring detection accuracy.
[0101] The display device 103 may also be a touch screen display or a screen of a terminal device, which is used to receive user instructions while displaying the above content to achieve interaction with the user.
[0102] It should be understood that the above-mentioned processing device can be implemented by a processor reading instructions in a memory and executing the instructions, or it can be implemented by a chip circuit.
[0103] In addition, the network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Ordinary technicians in this field can know that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.
[0104] Figure 2 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 1 ,like Figure 2 As shown, the link delay detection method provided by this embodiment includes:
[0105] S201 : In response to the start of delay detection of a link to be detected, detecting a basic round trip propagation time of the link to be detected.
[0106] When link delay detection is started, basic network characteristic detection is performed first. The link cache data is cleared during the draining phase to capture the basic round-trip propagation time (RTprop) of the link to be detected, which serves as the benchmark reference value for subsequent detections.
[0107] S202: Detect a first real-time bottleneck bandwidth of the link to be detected.
[0108] During the bandwidth detection phase, the real-time transmission capacity of the link is continuously monitored. By dynamically adjusting the sending rate and observing changes in the delivery rate, the first real-time bottleneck bandwidth (BtlBw) of the current network path is accurately located, reflecting the maximum transmission rate that the link can actually carry.
[0109] S203: Acquire multiple preset congestion window values; the largest one among the multiple preset congestion window values is a first congestion window value.
[0110] Multiple sets of congestion window values of different sizes are preconfigured, where the largest of the multiple preset congestion window values is the first congestion window value. These preset values constitute the detection parameter set, providing a basis for subsequent comparative testing.
[0111] S204: Perform a first delay detection on the link to be detected according to the first congestion window value to obtain a first delay bottleneck bandwidth.
[0112] The first congestion window value is selected for the first delay detection, and the link carrying limit is tested by a large traffic impact to obtain the first delay bottleneck bandwidth at this time.
[0113] S205 : Determine a target congestion window value for link delay detection from a plurality of preset congestion window values according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth.
[0114] The first real-time bottleneck bandwidth and the first delay bottleneck bandwidth are comprehensively compared. If the difference exceeds the threshold, the window parameters are gradually reduced. If they meet expectations, the window value is fixed. Ultimately, the target congestion window value is selected that can accurately measure latency without wasting bandwidth.
[0115] The present application provides a link delay detection method. First, the basic link delay characteristics are obtained to provide a benchmark for detection. Second, the upper limit of the link's real-time transmission capacity is captured to reflect the current network status. Then, different sending window values are preset to provide parameters for subsequent comparison. At the same time, the maximum window is used to evaluate the delay impact under large traffic. Finally, the real-time bandwidth and delay data are combined to screen out the optimal sending window that can accurately reflect the link delay characteristics while avoiding data accumulation, thereby achieving the technical effect of improving the efficiency of link delay detection.
[0116] Figure 3 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 2 ,like Figure 3 As shown, this embodiment provides a supplementary explanation of the process of determining the target congestion window value based on the above embodiment, including:
[0117] S301: Obtain a preset judgment coefficient threshold.
[0118] In this embodiment, the judgment coefficient is used to quantify the allowable bandwidth measurement error range.
[0119] Read the preset judgment coefficient threshold from the system configuration.
[0120] S302: Calculate a first difference between a first delayed bottleneck bandwidth and a first real-time bottleneck bandwidth.
[0121] In this embodiment, the first difference refers to an absolute difference.
[0122] A first difference between the first delay bottleneck bandwidth obtained by large window detection and the first real-time bottleneck bandwidth monitored in real time is calculated to quantify the degree of deviation between the results of the two measurement methods.
[0123] S303: Calculate the ratio of the first difference to the first real-time bottleneck bandwidth.
[0124] The first difference is divided by the first real-time bottleneck bandwidth to convert it into a relative deviation ratio, eliminating the impact of absolute bandwidth magnitude differences and making the deviations in different network scenarios comparable.
[0125] S304: Compare the ratio with a preset judgment coefficient threshold to determine a comparison result.
[0126] The calculated relative deviation ratio is compared with the preset threshold. If the deviation ratio is lower than the threshold, it indicates that the detection result of the current first congestion window value is reliable. If it exceeds the threshold, it indicates that the large window corresponding to the first congestion window value causes data accumulation, affecting measurement accuracy.
[0127] S305 : Determine a target congestion window value for link delay detection from a plurality of preset congestion window values according to the comparison result.
[0128] The window parameters are dynamically selected based on the comparison results: when the deviation exceeds the limit, the window value is gradually reduced. When the deviation is within the allowable range, the current window value is fixed as the target congestion window value.
[0129] S306: Perform delay detection on the link to be detected according to the target congestion window value.
[0130] The final target window value is used to continuously perform latency detection, ensuring measurement accuracy while maintaining a reasonable network resource utilization rate, forming a continuous detection mechanism that adapts to network changes.
[0131] The link delay detection method provided in the embodiments of the present application achieves intelligent optimization of detection parameters through a quantized error control mechanism: first, an error tolerance benchmark is established, the measurement deviations of different detection methods are dynamically calculated, and then interference factors are eliminated through relative deviation analysis. Ultimately, the optimal window value is matched to ensure the authenticity of delay measurement while avoiding bandwidth waste, thereby building an error-controllable adaptive detection system, thereby ensuring improved link delay detection accuracy and reliability, and achieving the technical effect of improving link delay detection efficiency.
[0132] Figure 4 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 3 ,like Figure 4 As shown, this embodiment, based on the above embodiment, describes in detail the process of determining the comparison result. The multiple preset congestion window values further include a preset minimum congestion window value, a second congestion window value, and a third congestion window value. The preset minimum congestion window value is smaller than the second congestion window value, and the second congestion window value is smaller than the third congestion window value. The determination process includes:
[0133] S401: Compare the ratio with a preset judgment coefficient threshold to determine a comparison result.
[0134] The calculated relative deviation ratio is compared with the preset threshold, and a quantitative evaluation is performed to determine whether the current detection window causes data accumulation.
[0135] S402: If the comparison result is that the ratio is smaller than a preset judgment coefficient threshold, the first congestion window value is determined as the target congestion window value.
[0136] If the comparison result is that the ratio is less than the preset judgment coefficient threshold, it indicates that the currently used maximum preset window neither causes significant measurement deviation nor fully utilizes network bandwidth resources. Therefore, the first congestion window value is determined as the target congestion window value.
[0137] S403: If the comparison result shows that the ratio is not less than the preset judgment coefficient threshold, one of the preset minimum congestion window value, the second congestion window value, and the third congestion window value is determined as the target congestion window value.
[0138] If the comparison result shows that the ratio is not less than the preset judgment coefficient threshold, the window degradation mechanism is activated. At this time, more conservative sending window values are tested in the preset parameter set in the order of minimum window, second smallest window, and middle window. A parameter that meets the error requirement among the minimum, second, and third congestion windows is found and determined as the target congestion window value.
[0139] The link delay detection method provided in the embodiments of the present application implements intelligent optimization of detection parameters through a hierarchical window verification mechanism: first, an error tolerance benchmark is established to verify the credibility of large-window detection results; when the measurement deviation is within the allowable range, the efficient window value is directly adopted to improve bandwidth utilization; when the deviation exceeds the limit, a multi-level reduction test is initiated, and the preset minimum / second minimum / intermediate window values are checked step by step to ultimately match the optimal window value that both ensures the authenticity of the delay measurement and avoids bandwidth waste. This establishes an adaptive detection system with controllable errors, thereby ensuring improved link delay detection accuracy and reliability, and achieving the technical effect of improving link delay detection efficiency.
[0140] Figure 5 Schematic diagram of the link delay detection method provided in this embodiment of the application Figure 4 ,like Figure 5 As shown, based on the above embodiment, after determining that the comparison result is that the ratio is not less than the preset judgment coefficient threshold, this embodiment further describes in detail the process of determining the target congestion window value, including:
[0141] S501 : performing a network path cache clearing operation for a link to be detected according to a preset minimum congestion window value, and detecting a second real-time bottleneck bandwidth of the link to be detected after the network path cache is cleared.
[0142] When large-window detection causes measurement deviation to exceed the limit, the minimum preset window, namely the minimum congestion window, is first enabled. By limiting the sending rate, any cached data in the network path is completely cleared to ensure that subsequent measurements are not affected by residual data. After the cache is cleared, the second real-time bottleneck bandwidth of the link to be detected is re-tested to determine the real-time transmission capacity of the link.
[0143] S502: Perform a second delay detection on the link to be detected according to the second congestion window value to obtain a second delay bottleneck bandwidth, and determine whether to determine the second congestion window value as a target congestion window value according to the second real-time bottleneck bandwidth and the second delay bottleneck bandwidth.
[0144] A second round of delay detection is performed using the next smallest preset window, the second congestion window. A medium-scale traffic shock is applied to test link characteristics. Combined with the actual bandwidth value detected after clearing the cache, the second congestion window parameter is used to verify whether it ensures measurement accuracy while avoiding data accumulation. If the error requirements are met, the window parameters are fixed.
[0145] S503: If it is determined that the second congestion window value is not to be determined as the target congestion window value, a network path cache flushing operation is performed for the link to be detected according to the preset minimum congestion window value, and after the network path cache is flushed, a third real-time bottleneck bandwidth of the link to be detected is detected.
[0146] If the smaller preset window still causes the measurement deviation to exceed the limit, the smallest window is used again to clear the network cache and recapture the current actual transmission capacity of the link, that is, the third real-time bottleneck bandwidth, to provide benchmark data for subsequent smaller window detections.
[0147] S504: Perform a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth, and determine whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delay bottleneck bandwidth.
[0148] Using the intermediate preset window, that is, performing the third round of delay detection in the third congestion window, the link characteristics are tested through a relatively conservative traffic impact. Combined with the baseline bandwidth value after clearing the cache, the third congestion window value is evaluated to see whether it meets the measurement accuracy requirements. If so, the window parameters are fixed.
[0149] S505: If it is determined that the third congestion window value is not to be determined as the target congestion window value, a network path cache flushing operation is performed for the link to be detected according to the preset minimum congestion window value, and after the network path cache is flushed, a third real-time bottleneck bandwidth of the link to be detected is detected.
[0150] If the intermediate preset window still causes the deviation to exceed the limit, the minimum preset window cache clearing operation is performed again to ensure that the network path is in a state without cache interference, and the real-time transmission capacity of the link is re-tested to provide benchmark data for the final window selection.
[0151] S506: Perform a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth, and determine whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delay bottleneck bandwidth.
[0152] Repeat the use of the intermediate preset window for the fourth round of delay detection. Through secondary verification of the same parameters, misjudgment caused by occasional network fluctuations can be eliminated. If the results of two consecutive detections do not meet the accuracy requirements, it is confirmed that the window parameters need to be further reduced.
[0153] S507: If it is determined not to determine the third congestion window value as the target congestion window value, determine to determine the preset minimum congestion window value as the target congestion window value.
[0154] When all preset windows cannot meet the measurement accuracy requirements, as a fallback strategy, the minimum preset window is forced to be used for detection to ensure that the benchmark delay measurement value without cache interference is obtained and the credibility of the detection result is guaranteed.
[0155] The link delay detection method provided in the embodiment of the present application achieves precise matching of detection parameters through a progressive window verification mechanism: first, a cache clearing benchmark is established to ensure the purity of the measurement basic conditions through the minimum window; then, the sub-minimum and intermediate window parameters are tested step by step, and the measurement deviation is dynamically evaluated in combination with real-time bandwidth data; when all preset windows do not meet the requirements, the minimum window is returned to, and a verification system covering the entire parameter space is constructed. This process avoids the data accumulation interference caused by large windows and prevents the bandwidth waste of small windows. Ultimately, a dynamic balance is achieved between measurement accuracy and transmission efficiency, forming a delay detection solution that adapts to network changes and achieves the technical effect of improving link delay detection efficiency.
[0156] Figure 6 This is a schematic diagram of the structure of the link delay detection device provided in the embodiment of the present application. The device of this embodiment can be in the form of software and / or hardware. Figure 6 As shown, the link delay detection device 600 provided in the embodiment of the present application includes: a first detection module 601, a second detection module 602, an acquisition module 603, a detection module 604, and a determination module 605:
[0157] A first detection module 601 is configured to detect a basic round trip propagation time of a link to be detected in response to the start of delay detection of the link to be detected;
[0158] The second detection module 602 is used to detect a first real-time bottleneck bandwidth of the link to be detected;
[0159] An acquisition module 603 is configured to acquire a plurality of preset congestion window values, wherein the largest one among the plurality of preset congestion window values is a first congestion window value;
[0160] A detection module 604 is configured to perform a first delay detection on the link to be detected according to the first congestion window value to obtain a first delay bottleneck bandwidth;
[0161] The determination module 605 is configured to determine a target congestion window value for link delay detection from a plurality of preset congestion window values according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth.
[0162] In a possible implementation, the determining module 605 is further configured to:
[0163] Obtaining a preset judgment coefficient threshold;
[0164] Calculating a first difference between a first delayed bottleneck bandwidth and a first real-time bottleneck bandwidth;
[0165] Calculating a ratio of the first difference to the first real-time bottleneck bandwidth;
[0166] Comparing the ratio with a preset judgment coefficient threshold to determine a comparison result;
[0167] According to the comparison result, a target congestion window value for link delay detection is determined from a plurality of preset congestion window values.
[0168] In a possible implementation, the determining module 605 is further configured to:
[0169] If the comparison result is that the ratio is smaller than the preset judgment coefficient threshold, the first congestion window value is determined as the target congestion window value.
[0170] In a possible implementation, the multiple preset congestion window values further include a preset minimum congestion window value, a second congestion window value, and a third congestion window value; the preset minimum congestion window value is smaller than the second congestion window value, and the second congestion window value is smaller than the third congestion window value;
[0171] Accordingly, the determining module 605 is further configured to:
[0172] If the comparison result is that the ratio is not less than the preset judgment coefficient threshold, one of the preset minimum congestion window value, the second congestion window value, and the third congestion window value is determined as the target congestion window value.
[0173] In a possible implementation, the determining module 605 is further configured to:
[0174] According to the preset minimum congestion window value, the network path cache of the link to be detected is cleared;
[0175] After the network path cache is cleared, detecting the second real-time bottleneck bandwidth of the link to be detected;
[0176] Performing a second delay detection on the link to be detected according to the second congestion window value to obtain a second delay bottleneck bandwidth;
[0177] According to the second real-time bottleneck bandwidth and the second delay bottleneck bandwidth, it is determined whether to determine the second congestion window value as the target congestion window value.
[0178] In a possible implementation, the determining module 605 is further configured to:
[0179] If it is determined that the second congestion window value is not to be determined as the target congestion window value, then performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0180] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0181] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0182] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0183] In a possible implementation, the determining module 605 is further configured to:
[0184] If it is determined that the third congestion window value is not to be determined as the target congestion window value, performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value;
[0185] After the network path cache is cleared, detecting the third real-time bottleneck bandwidth of the link to be detected;
[0186] performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth;
[0187] According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
[0188] In a possible implementation, the determining module 605 is further configured to:
[0189] If it is determined not to determine the third congestion window value as the target congestion window value, it is determined to determine the preset minimum congestion window value as the target congestion window value.
[0190] In a possible implementation, the determining module 605 is further configured to:
[0191] According to the target congestion window value, a delay detection is performed on the link to be detected.
[0192] The link delay detection device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effects are similar, and are not described in detail in this embodiment.
[0193] Figure 7 This is a schematic diagram of the structure of the link delay detection device provided in the embodiment of the present application. Figure 7 As shown, the link delay detection device 700 provided in this embodiment includes: at least one processor 701 and a memory 702. Optionally, the device 700 further includes a communication component 703. The processor 701, the memory 702, and the communication component 703 are connected via a bus.
[0194] During the specific implementation process, at least one processor 701 executes the computer-executable instructions stored in the memory 702, so that the at least one processor 701 performs the above method.
[0195] The specific implementation process of the processor 701 can be found in the above method embodiment. Its implementation principle and technical effects are similar and will not be repeated here in this embodiment.
[0196] In the above embodiments, it should be understood that the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASICs), etc. A general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the present invention may be directly executed by a hardware processor or by a combination of hardware and software modules within the processor.
[0197] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage.
[0198] A bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus. Buses can be categorized as address buses, data buses, and control buses. For ease of illustration, the buses in the drawings of this application are not limited to just one bus or just one type of bus.
[0199] An embodiment of the present application also provides a computer program product, including a computer program, which implements the above method when executed by a processor.
[0200] An embodiment of the present application further provides a computer-readable storage medium, in which computer-executable instructions are stored. When a processor executes the computer-executable instructions, the above-mentioned method is implemented.
[0201] The readable storage medium may be implemented by any type of volatile or non-volatile memory 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 may be any available medium that can be accessed by a general-purpose or special-purpose computer.
[0202] An exemplary readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be an integral part of the processor. The processor and the readable storage medium can be located in an application specific integrated circuit (ASIC). Of course, the processor and the readable storage medium can also exist in the device as discrete components.
[0203] The division of units is merely a logical functional division; actual implementations may employ alternative divisions, such as combining or integrating multiple units or components into another system, or omitting or disabling certain features. Furthermore, any direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection between devices or units, either through an interface, electrical, mechanical, or other means.
[0204] Units described as separate components may or may not be physically separate, and 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 these units may be selected to achieve the purpose of this embodiment according to actual needs.
[0205] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0206] 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 the present invention, or the portion that contributes to the prior art, or a portion 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 for causing a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the various embodiments of the method of the present invention. The aforementioned storage medium includes various media that can store program code, such as USB flash drives, mobile hard drives, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical disks.
[0207] Those skilled in the art will appreciate that all or part of the steps in the above-described method embodiments can be implemented using hardware associated with 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. The aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.
[0208] Finally, it should be noted that those skilled in the art will readily identify other embodiments of the present invention after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses, or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art not disclosed herein. The present invention is not limited to the precise structure described above and illustrated in the accompanying drawings, and various modifications and variations may be made without departing from the scope thereof. The scope of the present invention is limited solely by the appended claims.
Claims
1. A link delay detection method, characterized in that: include: In response to the start of delay detection of a link to be detected, detecting a basic round trip propagation time of the link to be detected; Detecting a first real-time bottleneck bandwidth of the link to be detected; Acquire multiple preset congestion window values; wherein the largest one of the multiple preset congestion window values is a first congestion window value; Performing a first delay detection on the link to be detected according to the first congestion window value to obtain a first delay bottleneck bandwidth; According to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth, a target congestion window value for link delay detection is determined from the multiple preset congestion window values.
2. The method according to claim 1, characterized in that The determining, according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth, a target congestion window value for link delay detection from the plurality of preset congestion window values includes: Obtaining a preset judgment coefficient threshold; Calculating a first difference between the first delayed bottleneck bandwidth and the first real-time bottleneck bandwidth; Calculating a ratio of the first difference to the first real-time bottleneck bandwidth; Comparing the ratio with the preset judgment coefficient threshold to determine a comparison result; According to the comparison result, a target congestion window value for link delay detection is determined from the multiple preset congestion window values.
3. The method according to claim 2, characterized in that Determining, according to the comparison result, a target congestion window value for link delay detection from the plurality of preset congestion window values includes: If the comparison result is that the ratio is smaller than the preset judgment coefficient threshold, the first congestion window value is determined as the target congestion window value.
4. The method according to claim 2, characterized in that The multiple preset congestion window values further include a preset minimum congestion window value, a second congestion window value, and a third congestion window value; the preset minimum congestion window value is smaller than the second congestion window value, and the second congestion window value is smaller than the third congestion window value; Accordingly, determining, according to the comparison result, a target congestion window value for link delay detection from the multiple preset congestion window values includes: If the comparison result is that the ratio is not less than the preset judgment coefficient threshold, one of the preset minimum congestion window value, the second congestion window value, and the third congestion window value is determined as the target congestion window value.
5. The method according to claim 4, characterized in that The determining one of the preset minimum congestion window value and a plurality of second congestion window values as the target congestion window value includes: According to the preset minimum congestion window value, performing a network path cache clearing operation for the link to be detected; After the network path cache is cleared, detecting a second real-time bottleneck bandwidth of the link to be detected; performing a second delay detection on the link to be detected according to the second congestion window value to obtain a second delay bottleneck bandwidth; According to the second real-time bottleneck bandwidth and the second delayed bottleneck bandwidth, it is determined whether to determine the second congestion window value as the target congestion window value.
6. The method according to claim 5, characterized in that After determining whether to determine the second congestion window value as the target congestion window value according to the second real-time bottleneck bandwidth and the second delayed bottleneck bandwidth, the method further includes: If it is determined that the second congestion window value is not to be determined as the target congestion window value, performing a network path cache clearing operation for the link to be detected according to the preset minimum congestion window value; After the network path cache is cleared, detecting a third real-time bottleneck bandwidth of the link to be detected; performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth; According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
7. The method according to claim 6, characterized in that After determining whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, the method further includes: If it is determined that the third congestion window value is not to be determined as the target congestion window value, performing a network path cache flushing operation for the link to be detected according to the preset minimum congestion window value; After the network path cache is cleared, detecting a third real-time bottleneck bandwidth of the link to be detected; performing a third delay detection on the link to be detected according to the third congestion window value to obtain a third delay bottleneck bandwidth; According to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, it is determined whether to determine the third congestion window value as the target congestion window value.
8. The method according to claim 7, characterized in that After determining whether to determine the third congestion window value as the target congestion window value according to the third real-time bottleneck bandwidth and the third delayed bottleneck bandwidth, the method further includes: If it is determined not to determine the third congestion window value as the target congestion window value, then it is determined to determine the preset minimum congestion window value as the target congestion window value.
9. The method according to any one of claims 1 to 7, characterized in that After determining a target congestion window value for link delay detection from the plurality of preset congestion window values according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth, the method further includes: Delay detection for the link to be detected is performed according to the target congestion window value.
10. A link delay detection device, characterized in that: include: A first detection module is configured to detect a basic round trip propagation time of a link to be detected in response to the delay detection of the link to be detected being started; A second detection module is used to detect a first real-time bottleneck bandwidth of the link to be detected; An acquisition module, configured to acquire a plurality of preset congestion window values; wherein the largest one of the plurality of preset congestion window values is a first congestion window value; a detection module, configured to perform a first delay detection on the link to be detected according to the first congestion window value, so as to obtain a first delay bottleneck bandwidth; The determining module is configured to determine a target congestion window value for link delay detection from the plurality of preset congestion window values according to the first real-time bottleneck bandwidth and the first delay bottleneck bandwidth.
11. A link delay detection device, characterized in that: include: Memory, processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory, so that the processor performs the method according to any one of claims 1 to 9.
12. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 9 when executed by a processor.
13. A computer program product, characterized in that The invention comprises a computer program, which implements the method according to any one of claims 1 to 9 when the computer program is executed by a processor.