CN117255038A - TCP data packet loss monitoring method - Google Patents
TCP data packet loss monitoring method Download PDFInfo
- Publication number
- CN117255038A CN117255038A CN202311511051.6A CN202311511051A CN117255038A CN 117255038 A CN117255038 A CN 117255038A CN 202311511051 A CN202311511051 A CN 202311511051A CN 117255038 A CN117255038 A CN 117255038A
- Authority
- CN
- China
- Prior art keywords
- switching node
- data packet
- probability
- transmission
- packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000012544 monitoring process Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000005540 biological transmission Effects 0.000 claims abstract description 114
- 230000004044 response Effects 0.000 claims abstract description 11
- 238000012790 confirmation Methods 0.000 claims abstract description 3
- 238000004364 calculation method Methods 0.000 claims description 15
- 238000004891 communication Methods 0.000 abstract description 2
- 230000000694 effects Effects 0.000 abstract description 2
- 238000012546 transfer Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/06—Generation of reports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
- H04L43/0864—Round trip delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/19—Flow control; Congestion control at layers above the network layer
- H04L47/193—Flow control; Congestion control at layers above the network layer at the transport layer, e.g. TCP related
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to the technical field of communication, in particular to a TCP data packet loss monitoring method, which comprises the following steps: calculating and outputting the probability of successful transmission of the data packet of each switching node in response to the confirmation of the first parameter, wherein the first parameter comprises the acquired position of the switching node of the transmission link, the data packet round trip time of the switching node in the historical data of the transmission link, the data packet round trip time when network congestion occurs in the historical data, the transmission times of the same data packet and the total number of the transmission data packets; calculating and outputting a weight of each switching node in response to the second parameter being confirmed, the second parameter including a packet of the switching node, the number of output links, and a maximum bandwidth of each link; and calculating the comprehensive transmission success probability and the data packet loss probability according to the data packet transmission success probability and the weight, and generating a monitoring report. The TCP data packet loss monitoring method and device have the effect of improving TCP data packet loss monitoring accuracy.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method for monitoring loss of a TCP packet.
Background
The transmission control protocol (Transmission Control Protocol, TCP) is the most widely used transmission control protocol at present, and as the number of hosts increases and the data traffic increases, when there are too many packets in the network, the network performance will obviously decrease, and resource competition will occur, so that congestion occurs in the network, and thus, TCP packets will be lost. The congestion control mechanism is a core element of TCP, and reduces the speed of sending data to the network when the network is congested, so as to prevent vicious circle; and meanwhile, when the network is idle, the speed of transmitting data is improved, and network resources are utilized to the maximum extent.
In the prior art, patent document with publication number CN108023686a discloses a method, a device and a system for processing TCP delay, which make delay of acquiring data by a terminal lower through the condition of TCP round trip time (TCP Round Trip Time, TCP RTT) change.
In the prior art, only TCP RTT is considered, and factors such as retransmission times, link number and the like in the data packet transmission process are not considered, so that a monitoring result is inaccurate.
Disclosure of Invention
In order to improve the accuracy of TCP data packet loss monitoring, the size of a slow start window and the window growth rate of each switching node are adjusted according to monitoring results, and the TCP data packet loss monitoring method adopts the following technical scheme:
a TCP data packet loss monitoring method comprises the following steps:
calculating and outputting the data packet transmission success probability of each switching node in response to the confirmation of the first parameter, wherein the first parameter comprises the acquired position of the switching node of the transmission link, the data packet round trip time of the switching node in the historical data of the transmission link, the data packet round trip time when network congestion occurs in the historical data, the same data packet transmission times and the total number of the transmission data packets, and the calculation formula of the data packet transmission success probability is as follows:
wherein->Is a position +.>The probability of success of packet transmission of the switching node of +.>The expression position is +.>The average value of the round trip time of the switching node packets,the expression position is +.>In the switching node history data of (a) the average value of packet round trip time when network congestion occurs,/for the packet round trip time when network congestion occurs>The expression position is +.>The total number of data packet transmissions of the same switching node, < >>The expression position is +.>The total number of data packets transmitted by the switching node;
calculating and outputting a weight of each switching node in response to a second parameter being confirmed, wherein the second parameter comprises a data packet of the switching node, the number of output links and the maximum bandwidth of each link, and the expression of the weight is as follows:wherein->The expression position is +.>Weights of switching nodes of +.>Indicate->Output links->Indicate->Maximum bandwidth of the individual output links, +.>Maximum packet capacity representing the output of a switching node,/->Indicate->Input links->Indicate->Maximum bandwidth of the individual input links, +.>Representing the maximum packet capacity at the input of the switching node; according to the data packet transmission success probability and the weight, calculating the comprehensive transmission success probability and the data packet loss probability to generate a monitoring report, wherein the calculation formula of the comprehensive transmission success probability is as follows: />Wherein->The expression position is +.>The probability of success of the integrated transmission of the switching node, +.>The expression position is +.>Weights of switching nodes of +.>Indicating that the position is +.>The probability of successful transmission of the data packet of the switching node is calculated according to the calculation formula: probability of packet loss = 1-probability of integrated transmission success, the probability of integrated transmission success being less than or equal to 1.
By adopting the technical scheme, a plurality of parameters of data transmission, such as the round trip time of data packets of the switching nodes in the transmission link and the historical data of the transmission link, the same data packet transmission times, the total number of the transmission data packets and the like, are monitored, the probability and the weight of successful data packet transmission of each switching node are calculated, the comprehensive transmission success probability and the loss probability of each switching node are calculated according to the probability and the weight of successful data packet transmission of each switching node, and the accuracy of the TCP data packet loss monitoring result is improved.
Optionally, the method further comprises the steps of: the size of the slow start window is calculated by the following formula:
wherein->Indicate->The size of the slow start window of the individual switching nodes, < >>Represent the firstSize of congestion window when network congestion occurs in individual switching node, +.>Indicate->The probability of the integrated transmission success of the data packets of the individual switching nodes, < >>Indicate->Total number of TCP packets transmitted in each time period, < >>A peak value representing the total number of TCP packets transmitted; responsive to->Judging that network congestion does not occur, and keeping the slow start window size to be +.>The size of the slow start window of each switching node; responsive to->It is determined that network congestion may occur, keeping the slow start window size +.>The size of the congestion window when network congestion occurs at each switching node.
Optionally, the method further comprises the steps of: in response to the window size exceeding the threshold range, adjusting a rate of increase of the window, the rate of increase adjusted to:wherein->Representing the adjustedWindow size growth rate,/->Indicating an unadjusted window size growth rate, < >>Peak value representing total number of TCP packets of said transmission, < >>Indicate->And transmitting the total number of TCP data packets in each time period.
By adopting the technical scheme, the window is controlled by the comprehensive transmission success probability of each switching node and the inverse of the peak ratio of the total number of the TCP data packets transmitted in each time period to the total number of the TCP data packets, so that the purpose of adjusting the size of the slow start window of each switching node is achieved.
Optionally, the calculating and outputting the probability of successful transmission of the data packet of each switching node includes calculating the position asThe average value of the round trip time of the data packet of the switching node is calculated as follows: />Wherein->The expression position is +.>Is the average value of the round trip times of the switching node packets,/-, is the sum of the round trip times of the switching node packets>The expression position is +.>Switch node%>Round trip time for transmitting the same data packet again, +.>The same number of data packet transmissions.
Optionally, the calculating and outputting the probability of successful transmission of the data packet of each switching node includes calculating the position asThe average value of the round trip time of the data packet when network congestion occurs in the historical data of the switching node is calculated as follows:wherein->The expression position is +.>In the switching node history data of (a) the average value of packet round trip time when network congestion occurs,/for the packet round trip time when network congestion occurs>The expression position is +.>Is +.>Round trip time of data packet when network congestion occurs next time,/->The expression position is +.>The number of network congestion occurrences in the switching node history data.
Optionally, the calculation of the probability of successful data packet transmission includes the following steps: responsive to the currentThe instruction that the individual switching node successfully transmitted is acknowledged, calculated +.>The probability of successful transmission of the data packet of the switching node at the position is calculated by the following formula:wherein->The expression position is +.>Probability of success of transmission of data packets of the switching node, < + >>The expression position is +.>Round trip time of switching node packets in history of (a) is +.>The expression position is +.>In the switching node history data of (a) the round trip time of the data packet when network congestion occurs, +.>The expression position is +.>The switching node of (a) the same total number of retransmissions of a data packet, is->Representing the position asThe total number of data packets transmitted by the switching node of +.>Before->Probability of successful transmission of data packets by each switching node.
By adopting the technical scheme, the positions of the switching nodes passing through the transmission link in the transmission process of the data packet are in sequence, so the switching nodes are positionedProbability of successful transmission of data packets of a switching node at a location and before +.>Whether or not the packet transfer of the switching node at the individual location is successful, only currently +.>The next node can continue to transmit when each switching node successfully transmits, and the +.A/D is calculated according to the number of switching nodes, round trip time of the switching node data packet in the history data and other parameters>Switching node data of the location, implementing the calculation of +.>Probability of successful packet transmission of next node of each switching node.
The application has the following technical effects:
1. the probability and weight of successful data packet transmission of each switching node are calculated through a plurality of monitored parameters of data transmission, such as the round trip time of data packets of switching nodes in transmission links and historical data of the transmission links, the transmission times of the same data packets, the total number of the transmitted data packets and the like, and the comprehensive transmission success probability and loss probability of each switching node are calculated according to the probability and weight of successful data packet transmission of each switching node, so that the accuracy of TCP data packet loss monitoring results is improved.
2. And controlling the window through the comprehensive transmission success probability of each switching node and the inverse of the peak ratio of the total number of TCP data packets transmitted in each time period to the total number of TCP data packets, so as to obtain the size of the slow start window and the growth rate of the window, and adjusting the size of the slow start window and the growth rate of the window of each switching node according to the monitoring result.
Drawings
The above, as well as additional purposes, features, and advantages of exemplary embodiments of the present application will become readily apparent from the following detailed description when read in conjunction with the accompanying drawings. In the drawings, several embodiments of the present application are shown by way of example and not by way of limitation, and identical or corresponding reference numerals indicate identical or corresponding parts.
Fig. 1 is a method flowchart of a method for monitoring a TCP packet loss according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all, of the embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
It should be understood that when the terms "first," "second," and the like are used in the claims, specification, and drawings of this application, they are used merely for distinguishing between different objects and not for describing a particular sequential order. The terms "comprises" and "comprising," when used in the specification and claims of this application, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The embodiment of the application discloses a TCP data packet loss monitoring method, referring to FIG. 1, comprising steps S1-S7, specifically comprising the following steps:
s1: in response to the first parameter being acknowledged, a probability of successful transmission of the data packet for each switching node is calculated and output.
Specifically, the first parameter includes a location of the collected switching node of the transmission link, a round trip time of a data packet of the switching node in the history data of the transmission link, a round trip time of a data packet when network congestion occurs in the history data, a number of times of transmission of the same data packet, and a total number of transmitted data packets.
Wherein the switching node can be router, switch, etc., and the position of the switching node of the data packet transmission link is collected and recorded asThe location represents the distance between the switching node and the sender in the network topology.
For example, when the switching node a is located at the Next Hop (Next Hop) of the transmitting end, the position of the switching node a is denoted as 1, and when the switching node B is located at the Next Hop ((Next Two Hops) of the transmitting end, the Next Hop refers to the Next network node required for the packet to reach the destination node from the current node, and the Next Hop refers to the network node following the Next Hop in the network path.
According to the first parameter, calculating the probability of successful transmission of the data packet, wherein the calculation formula is as follows:
wherein->Is a position +.>The probability of success of packet transmission of the switching node of +.>=1，2，...，/>The expression position is +.>Is a switching node of (a)Average value of packet round trip time,/>The expression position is +.>An average value of packet round trip times when network congestion occurs in the switching node history data.
In particular, the round trip time may be the moment at which a packet is sent by the switching nodeAnd the moment of reception of an ACK (acknowledgement) packet +.>Obtained (I)>I.e. round trip time of the packet, +.>The expression position is +.>The total number of transmissions of the same data packet of the switching node of (a), the same data packet can be determined by header information in the TCP data packet,/a->The expression position is +.>The switching node of (a) transmits the total number of data packets.
The calculation formula of (2) is as follows: />Wherein->The expression position is +.>Switch node%>Round trip time of transmitting the same data packet once, C is the transmission times of the same data packet.
The calculation formula of (2) is as follows: />Wherein->The expression position is +.>Is +.>Round trip time of data packet when network congestion occurs next time,/->Representing the position asThe number of network congestion occurrences in the switching node history data.
The positions of the switching nodes passing through the transmission link in the transmission process of the data packet are in sequence, and therefore are positionedProbability of successful transmission of data packets of a switching node at a location and before +.>Whether or not the packet transfer of the switching node at the individual location is successful, only currently +.>The next node can continue transmitting only when the switching node successfully transmits, thus +.>The calculation formula of the probability of successful transmission of the switching node of the position is as follows:wherein->The expression position is +.>Probability of success of transmission of data packets of the switching node, < + >>The expression position is +.>Round trip time of switching node packets in history of (a) is +.>The expression position is +.>In the switching node history data of (a) the round trip time of the data packet when network congestion occurs, +.>The expression position is +.>The switching node of (a) the same total number of retransmissions of a data packet, is->Representing the position asThe total number of data packets transmitted by the switching node of +.>Before->Probability of successful transmission of data packets by each switching node.
S2: in response to the second parameter being validated, a weight for each switching node is calculated and output.
The second parameter includes the data packets of the switching node, the number of outgoing links, and the maximum bandwidth per link. The expression of the weight is:wherein->The expression position is +.>Weights of switching nodes of +.>Indicate->Output links->Indicate->Maximum bandwidth of the individual output links, +.>Maximum packet capacity representing the output of a switching node,/->Indicate->Input links->Indicate->Maximum bandwidth of the individual input links, +.>Indicating the maximum packet capacity at the input of the switching node.
When the maximum data packet capacity of the output end of the switching node is larger, the data packet is less likely to generate congestion at the switching node, so that the data packet is less likely to be lost;
the larger the maximum data packet capacity at the input end of the switching node, the more likely the data packet is to cause congestion at the switching node, and the more likely the data packet is to be lost.
Therefore, the larger the maximum packet capacity at the output end of the switching node or the smaller the maximum packet capacity at the input end, the larger the probability of successful packet transmission is, and the larger the weight of the switching node is.
S3: and calculating the comprehensive transmission success probability and the data packet loss probability according to the data packet transmission success probability and the weight, and generating a monitoring report.
The transmission success probability of the TCP data packet when transmitted through the switching node is related to the round trip time and retransmission times of the transmitted data packet, the number of input links, the number of output links and the maximum bandwidth corresponding to each link of the switching node, when the data packet enters the device from the high-speed link and is forwarded out by the low-speed link, or the data packet enters the device from a plurality of interfaces at the same time, network congestion occurs between the links and the switching node when the data packet is forwarded out by an interface without enough bandwidth, thereby causing the loss of the data packet.
The calculation formula of the comprehensive transmission success probability is as follows:wherein->The expression position is +.>The probability of success of the integrated transmission of the switching node, +.>The expression position is +.>Weights of switching nodes of +.>The expression position is +.>The probability of successful transmission of the data packet of the switching node.
Because the number and the maximum bandwidth of the output links of the switching node are large, the obtained comprehensive transmission success probability may exceed 1, and this indicates that the bandwidth of the output link connected by the switching node is large, and all received data packets can be completely transmitted, so network congestion and data packet loss cannot occur, and the probability exceeding 1 is recorded as 1 in the application.
The calculation formula of the data packet loss probability is as follows: probability of packet loss = 1-probability of integrated transmission success.
S4: the size of the slow start window is calculated.
Where slow start refers to an algorithm in TCP that controls network congestion to gradually increase the size of the send window to probe the available bandwidth of the network as TCP establishes a connection or the network is congested. Specifically, the sender sets the size of the initial transmission window to a small value, typically the number of MSSs (Maximum Segment Size ), just before the TCP connection is established. After each successful receipt of an acknowledgement ACK (acknowledgement), the sender doubles the size of the send window. The sender may increase the size of the transmission window at an exponential rate and the amount of data transmitted increases.
The smaller the integrated transmission success probability of each switching node is, the smaller the size of the slow start window is, and the higher the probability of network congestion and the probability of data packet loss are. Since the total number of TCP packets transmitted by the switching node and the link in different time periods in one day is different, for example, in a local area network of a company, the total number of TCP packets transmitted by the switching node and the link is larger in working time and smaller in rest time, the size and the growth rate of the slow start window need to be adjusted by different time periods, which is as follows:
the total number of TCP packets transmitted by the switching node and link is collected every three hours for 24 hours a day, and a histogram of time and total number of TCP packets transmitted is constructed, and the time and total number of TCP packets transmitted can be collected every 3 hours from 0 point a day, and recorded as 1,2, 8. The total number of TCP data packets and the peak value of the total number of TCP data packets in each time period are collected.
The size of the slow start window is calculated by the following formula:wherein->Indicate->The size of the slow start window of the individual switching nodes, < >>Indicate->Size of congestion window when network congestion occurs in individual switching node, +.>Indicate->The probability of the integrated transmission success of the data packets of the individual switching nodes, < >>Indicate->Total number of TCP packets transmitted in each time period, < >>A peak representing the total number of transmitted TCP packets.
S5, responding toAnd judging that network congestion does not occur, and keeping the size of the slow start window to be the size of the slow start window of the ith switching node.
S6, responding toAnd judging that network congestion occurs, and keeping the size of the slow start window to be the size of a congestion window when the ith switching node is in network congestion.
And S7, adjusting the growth rate of the window in response to the window size exceeding the threshold range.
An initial value of the congestion window ssthresh (slow start threshold ) is collected. The threshold range is set between the slow start window size and the initial value of the congestion window ssthresh, and when the window size is within the threshold range, the window growth rate increases exponentially. And when the size of the window is out of the threshold range, namely between the initial value of the congestion window ssthresh and the size value of the congestion window when network congestion occurs, adjusting the growth rate, and obtaining a new ssthresh value. The growth rate is adjusted as follows:wherein->Indicating the rate of increase of the window size after adjustment,/->Indicating an unadjusted window size growth rate, < >>Peak value representing total number of TCP packets transmitted, +.>Indicate->The total number of TCP packets is transmitted for each time period.
The implementation principle of the TCP data packet loss monitoring method in the embodiment of the application is as follows: the probability and weight of successful data packet transmission of each switching node are calculated through a plurality of monitored parameters of data transmission, such as the round trip time of data packets of switching nodes in transmission links and historical data of the transmission links, the transmission times of the same data packets, the total number of the transmitted data packets and the like, and the comprehensive transmission success probability and loss probability of each switching node are calculated according to the probability and weight of successful data packet transmission of each switching node, so that the accuracy of TCP data packet loss monitoring results is improved.
And controlling the window by the comprehensive transmission success probability of each switching node and the inverse of the peak ratio of the total number of TCP data packets transmitted in each time period to the total number of TCP data packets to obtain the size and the growth rate of the slow start window, and adjusting the size and the growth rate of the slow start window of each switching node according to the monitoring result.
The foregoing are all preferred embodiments of the present application, and are not intended to limit the scope of the present application in any way, therefore: all equivalent changes in structure, shape and principle of this application should be covered in the protection scope of this application.
Claims (6)
1. A method for monitoring loss of a TCP packet, comprising the steps of:
calculating and outputting the transmission success probability of the data packet of each switching node in response to the confirmation of the first parameter, wherein the first parameter comprises the acquired position of the switching node of the transmission link, the round trip time of the data packet of the switching node in the historical data, the round trip time of the data packet when network congestion occurs in the historical data, the transmission times of the same data packet and the total number of the data packet to be transmitted, and the calculation formula of the transmission success probability of the data packet is as follows:
，
wherein,is a position +.>The probability of success of packet transmission of the switching node of +.>The expression position is +.>Is the average value of the round trip times of the switching node packets,/-, is the sum of the round trip times of the switching node packets>The expression position is +.>In the switching node history data of (a) the average value of packet round trip time when network congestion occurs,/for the packet round trip time when network congestion occurs>The expression position is +.>The total number of data packet transmissions of the same switching node, < >>The expression position is +.>The total number of data packets transmitted by the switching node;
calculating and outputting a weight of each switching node in response to a second parameter being confirmed, wherein the second parameter comprises a data packet of the switching node, the number of output links and the maximum bandwidth of each link, and the expression of the weight is as follows:
，
wherein,the expression position is +.>Weights of switching nodes of +.>Indicate->Output links->Indicate->Maximum bandwidth of the individual output links, +.>Maximum packet capacity representing the output of a switching node,/->Indicate->Input links->Indicate->Each input linkMaximum bandwidth of>Representing the maximum packet capacity at the input of the switching node;
according to the data packet transmission success probability and the weight, calculating the comprehensive transmission success probability and the data packet loss probability to generate a monitoring report, wherein the calculation formula of the comprehensive transmission success probability is as follows:
，
wherein,the expression position is +.>The probability of success of the integrated transmission of the switching node, +.>The expression position is +.>Weights of switching nodes of +.>Indicating that the position is +.>The probability of successful transmission of the data packet of the switching node is calculated according to the calculation formula: probability of packet loss = 1-probability of integrated transmission success, the probability of integrated transmission success being less than or equal to 1.
2. The method for monitoring the loss of a TCP packet according to claim 1, further comprising the steps of:
the size of the slow start window is calculated by the following formula:，
wherein,indicate->The size of the slow start window of the individual switching nodes, < >>Indicate->Size of congestion window when network congestion occurs in individual switching node, +.>Indicate->The probability of the integrated transmission success of the data packets of the individual switching nodes, < >>Indicate->Total number of TCP packets transmitted in each time period, < >>A peak value representing the total number of TCP packets transmitted;
responsive toJudging that network congestion does not occur, and keeping the slow start window size to be +.>Slow individual switching nodesThe size of the start window;
responsive toIt is determined that network congestion may occur, keeping the slow start window size +.>The size of the congestion window when network congestion occurs at each switching node.
3. The method for monitoring loss of TCP packets according to claim 2, further comprising the steps of:
in response to the window size exceeding the threshold range, adjusting a rate of increase of the window, the rate of increase adjusted to:
，
wherein,indicating the rate of increase of the window size after adjustment,/->Indicating an unadjusted window size growth rate, < >>Peak value representing total number of TCP packets of said transmission, < >>Indicate->And transmitting the total number of TCP data packets in each time period.
4. The method for monitoring loss of TCP packets according to claim 1, wherein said calculating andoutputting the probability of successful transmission of the data packet of each switching node, wherein the probability comprises the steps of calculating the position asThe average value of the round trip time of the data packet of the switching node is calculated as follows:
，
wherein,the expression position is +.>Is the average value of the round trip times of the switching node packets,/-, is the sum of the round trip times of the switching node packets>The expression position is +.>Switch node%>Round trip time for transmitting the same data packet again, +.>The same number of data packet transmissions.
5. The method for monitoring TCP packet loss according to claim 1, wherein said calculating and outputting the probability of successful packet transmission for each switching node comprises:
calculate the position asThe average value of the round trip time of the data packet when network congestion occurs in the historical data of the switching node is calculated as follows:
，
wherein,the expression position is +.>In the switching node history data of (a) the average value of packet round trip time when network congestion occurs,/for the packet round trip time when network congestion occurs>The expression position is +.>Is +.>Round trip time of data packet when network congestion occurs next time,/->The expression position is +.>The number of network congestion occurrences in the switching node history data.
6. The method for monitoring the loss of a TCP packet according to any one of claims 1 to 5, wherein the calculation of the probability of successful transmission of the packet comprises the steps of:
responsive to the currentThe instruction that the individual switching node successfully transmitted is acknowledged, calculated +.>Exchange joint of positionThe probability of successful transmission of the point data packet is calculated by the following formula:
，
wherein,the expression position is +.>Probability of success of transmission of data packets of the switching node, < + >>Representing the position asRound trip time of switching node packets in history of (a) is +.>The expression position is +.>In the switching node history data of (a) the round trip time of the data packet when network congestion occurs, +.>The expression position is +.>The switching node of (a) the same total number of retransmissions of a data packet, is->The expression position is +.>The total number of data packets transmitted by the switching node of +.>Before->Probability of successful transmission of data packets by each switching node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311511051.6A CN117255038B (en) | 2023-11-14 | 2023-11-14 | TCP data packet loss monitoring method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311511051.6A CN117255038B (en) | 2023-11-14 | 2023-11-14 | TCP data packet loss monitoring method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117255038A true CN117255038A (en) | 2023-12-19 |
| CN117255038B CN117255038B (en) | 2024-01-26 |
Family
ID=89133541
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311511051.6A Active CN117255038B (en) | 2023-11-14 | 2023-11-14 | TCP data packet loss monitoring method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117255038B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1556629A (en) * | 2004-01-06 | 2004-12-22 | �����ʵ��ѧ | Method for regulating congest window in communication network |
| CN103763212A (en) * | 2014-01-02 | 2014-04-30 | 河南科技大学 | Method for regulating network congestion |
| CN106789702A (en) * | 2016-12-30 | 2017-05-31 | 广州华多网络科技有限公司 | Control the method and device of TCP transmission performance |
| CN108023686A (en) * | 2016-11-02 | 2018-05-11 | 中兴通讯股份有限公司 | A kind of TCP delay process method, apparatus and system |
| CN111277502A (en) * | 2020-01-20 | 2020-06-12 | 北京红云融通技术有限公司 | Method for transmitting data by multi-link aggregation and transmitting equipment |
| CN112165355A (en) * | 2020-10-23 | 2021-01-01 | 中国电子科技集团公司第三十研究所 | Satellite network-oriented UDP-based reliable data transmission method |
| CN116112128A (en) * | 2023-04-14 | 2023-05-12 | 海马云（天津）信息技术有限公司 | Method and device for sending retransmission request, data receiving terminal equipment and storage medium |
| CN116684359A (en) * | 2023-05-06 | 2023-09-01 | 铜仁职业技术学院 | Network congestion control method, device and storage medium |
-
2023
- 2023-11-14 CN CN202311511051.6A patent/CN117255038B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1556629A (en) * | 2004-01-06 | 2004-12-22 | �����ʵ��ѧ | Method for regulating congest window in communication network |
| CN103763212A (en) * | 2014-01-02 | 2014-04-30 | 河南科技大学 | Method for regulating network congestion |
| CN108023686A (en) * | 2016-11-02 | 2018-05-11 | 中兴通讯股份有限公司 | A kind of TCP delay process method, apparatus and system |
| CN106789702A (en) * | 2016-12-30 | 2017-05-31 | 广州华多网络科技有限公司 | Control the method and device of TCP transmission performance |
| CN111277502A (en) * | 2020-01-20 | 2020-06-12 | 北京红云融通技术有限公司 | Method for transmitting data by multi-link aggregation and transmitting equipment |
| CN112165355A (en) * | 2020-10-23 | 2021-01-01 | 中国电子科技集团公司第三十研究所 | Satellite network-oriented UDP-based reliable data transmission method |
| CN116112128A (en) * | 2023-04-14 | 2023-05-12 | 海马云（天津）信息技术有限公司 | Method and device for sending retransmission request, data receiving terminal equipment and storage medium |
| CN116684359A (en) * | 2023-05-06 | 2023-09-01 | 铜仁职业技术学院 | Network congestion control method, device and storage medium |
Non-Patent Citations (5)
| Title |
|---|
| 张一鸣: "数据中心网络的拥塞控制策略研究", 中国优秀硕士学位论文全文数据库 信息科技辑, pages 137 - 14 * |
| 杨波, 中国优秀硕士学位论文全文数据库, no. 10 * |
| 王倩;徐如志;杨峰;: "无线网络中基于自适应带宽估计的跨层拥塞控制算法", 山东大学学报(理学版), no. 11 * |
| 谢宇治, 张力军: "在多跳Ad hoc网络中基于路由协议的TCP性能改进", 南京邮电学院学报, no. 03 * |
| 陈晶, 郑明春, 孟强: "一种基于历史连接的网络拥塞控制算法及其性能分析", 计算机研究与发展, no. 10 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117255038B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102468941B (en) | Network packet loss processing method and device | |
| JP4016387B2 (en) | Data flow control method | |
| US6535482B1 (en) | Congestion notification from router | |
| US7869365B2 (en) | System and program storage device for controlling data packet flows by manipulating data packets according to an actual manipulation rate | |
| US11558302B2 (en) | Data transmission method and apparatus | |
| EP2048833A1 (en) | Communications equipment | |
| CN114938350B (en) | Congestion feedback-based data stream transmission control method in lossless network of data center | |
| EP1240753A1 (en) | Congestion control method for a packet-switched network | |
| US20050041582A1 (en) | Method of enhancing the efficiency of data flow in communication systems | |
| CN106789702B (en) | Method and device for controlling transmission performance of TCP (Transmission control protocol) | |
| CN111614572B (en) | TCP network congestion control method based on RTT | |
| KR100922472B1 (en) | Communication terminal, communication control method, and communication control program | |
| CN113141314A (en) | Congestion control method and equipment | |
| CN117255038B (en) | TCP data packet loss monitoring method | |
| Pu et al. | Enhancements on router-assisted congestion control for wireless networks | |
| Nabeshima et al. | Improving the convergence time highspeed TCP | |
| CN112887218A (en) | Message forwarding method and device | |
| Afifi et al. | A dynamic delayed acknowledgment mechanism to improve TCP performance for asymmetric links | |
| Alnuem et al. | New algorithm to control TCP behavior over lossy links | |
| JP2893398B1 (en) | Congestion control method | |
| Brachman et al. | On TCP NCR improvement using ECN-capable routers | |
| Grieco et al. | Performance evaluation of Westwood+ TCP over WLANs with local error control | |
| KR101334990B1 (en) | Congestion window control method in Transmission Control Protocol | |
| Hindawi et al. | A proposed method for TCP congestion control using AIMD approach | |
| Cheng et al. | Improving the ramping up behavior of TCP slow start |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 710000 room 1407, block B, city gate, No. 1, Jinye Road, high tech Zone, Xi'an, Shaanxi Province Patentee after: Xi'an Mingfu Cloud Computing Co.,Ltd. Country or region after: China Address before: 710000 room 1407, block B, city gate, No. 1, Jinye Road, high tech Zone, Xi'an, Shaanxi Province Patentee before: Xi'an mingfuyun computing Co.,Ltd. Country or region before: China |
|
| CP03 | Change of name, title or address |