Network congestion control method and equipment

[0054] In order to make the objects, technical solutions and advantages of the present application, the technical solutions of the present application will be described in conjunction with the specific embodiments and corresponding drawings of the present application. Obviously, the described embodiments are merely the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, one of ordinary skill in the art is in the scope of the present application without making creative labor premistence.

[0055]At present, the currently used congestion control scheme is insufficient to sense the sense of perception of network congestion, leading to poor effects in congestion control. For this reason, in some embodiments of the present application: using hardware time to record the transmission time and reception time experienced by the target data packet in a single communication and its corresponding authentication data packets, in this way, the network can be calculated according to each hardware time. Delay, and based on network time delay knowledge network congestion and adjust the network rate of the local end. In the present application, the network delay is calculated based on the hardware time, and the accuracy of the network delay can be effectively improved, so that the network congestion is more accurate according to the network, and the network rate of the end of the end can be extended according to the network. Thereby achieving more accurate congestion control.

[0056] The technical solutions provided in the present application are described in detail below with reference to the accompanying drawings.

[0057] figure 1 A structural diagram of a communication system provided by an exemplary embodiment of the present application. like figure 1 As shown, the system includes: the first communication terminal 10 and the second communication terminal 20, the first communication terminal 10, and the second communication terminal 20 are deployed, there is a network congestion control device improved by the present embodiment, wherein the embodiment is The supplied network congestion control device can be implemented as a combination of software and / hardware. The network congestion control device provided in this embodiment can replace the network congestion control function of the first communication terminal 10 and the second communication end 20 in communication devices such as network cards, of course, may also be additionally deployed in the first communication terminal 10 and In addition to the original network congestion control function on the second communication end 20, in this case, the original network congestion control function can be directly discarded.

[0058] The network congestion control scheme provided in this embodiment can be applied in a scene of various needs to perform network congestion control, for example, network congestion control is performed inside the data center, of course, this is merely exemplary, the present embodiment to the application scenario Not limited. In different application scenarios, figure 1 The physical implementation form of the first communication terminal 10 and the second communication end 20 may not be exactly the same. For example, in the scenario of the data center, the first communication terminal 10 and the second communication end 20 can be a server included in the data center. In this embodiment, the physical form of the first communication end 10 and the second communication end 20 is not limited, and it is no longer exhaustive.

[0059] It is worth explanation. figure 1 It is a member device in the communication system, but it should be understood that in the application scenario, the case can be made from any two communication terminals in the application scenario. The secondary communication round-trip process will be described in the network congestion control scheme provided by the present embodiment. Wherein, the communication round-trip refers to the start of transmitting data from the transmitting end, and the transmitting end receives the confirmation from the receiving end. figure 1 An exemplary communication round-trip process is shown: the first communication terminal 10 transmits a target data packet to the second communication end 20; after, the second communication end 20 returns the authentication data for the target packet to the first communication end 10. Bag. It is worth explanating that the received data packet is not limited to dedicated response ACK, in the actual application, the second communication terminal 20 returns to the target data package after receiving the target packet The data packet of the ACK information can be used as a received data package here, and other data content that is loaded in the packet is not limited.

[0060] Among them, the received time record containing at least the peer transmit time and the target packet is included in the data packet. The peer transmission time is used to characterize the time of the second communication end 20 to transmit the define data packet; the received time record of the target packet is used to characterize the second communication end 20 to receive the target packet. Importantly, the hard-only time is used for these hours that you have included in the packet. In this embodiment, the first communication terminal 10 and the second communication end 20 typically use the communication hardware to receive / send the data packet, therefore, the hardware time in the present embodiment can be understood as the time information of the communication hardware itself maintenance. The system / software time. Among them, communication hardware can include, but is not limited to, NIC equipment, etc. Thus, in the present embodiment, the first communication terminal 10 can read the received time record of the peer transmit time corresponding to the receiving data packet from the define data packet.

[0061] The first communication terminal 10 also acquires the hardware time when the host receives the data packet, as the local reception time corresponding to the resulting data packet; the hardware time when the local transmission is transmitted, as the transmission of the target packet Time record. Wherein, the local reception time is used to characterize the time of the first communication end 10 to receive the deficiency data packet; the transmission time record of the target data packet is used to characterize the first communication end 10 to send the target packet to the second communication terminal 20. time.

[0062] Undertake figure 1 An exemplary communication round-trip process: The first communication terminal 10 can transmit the hardware time of the target data package when transmitting the target data package in the transmission of the target data package during the transmission of the target data package in the process of transmitting the target data package during the transmission of the target data package. The time record is written to the target packet. In the case where the second communication terminal 20 is received, the hardware time can be recorded as the target data packet as the transmitted time record of the target packet, in an optional implementation method, the second communication end 20 The local status information can be maintained for the target packet, and the transmit time record of the aforementioned target packet, the received time record of the target data is recorded in the local status information corresponding to the target data packet. Based on this, the second communication terminal 20 can also read the transmission time record and target of the target packet from the local status information of the target packet to the local status information of the target packet to the local status information of the target packet, and the second communication terminal 20 can also transmit a target packet. The received time record of the packet is written, and writes in the definition packet; it is also possible to use the hardware time of the communication hardware when the data package is transmitted, and the hardware time of the communication hardware is written as a native transmission time. Packets. Thereafter, the first communication terminal 10 receives a definition data packet, and can receive the current hardware time to a clear data packet using the communication hardware while receiving a data packet, as the local reception time, to this, The packet contains four hardware times: the local reception time, the peer transmission time, the transmit time record of the target packet, and the received time record of the target packet. As described above, in the present embodiment, the first communication terminal 10 may transmit time records that the local terminal reception time and the target data packet correspond to the local reception time and the target data packet. Moreover, in the present embodiment, both the first communication terminal 10 and the second communication end 20 can use its own communication hardware to write the hardware time of the receiving / send data package to the packet without additional software overhead. It can be advantageous to improve network performance.

[0063] In an actual application, the above-described four hardware time can be written in the form of the four hardware time in the form of a timestamp. figure 2 A schematic diagram of a timestamp in which a data packet is provided for an exemplary embodiment of the present application. refer to figure 2 The data packet can include 4 time stamps, where timestamp 1 is used to carry the transmission time record of the target packet, written by the second communication end 20; timestamp 2 is used to carry the received target packet. The time record is written by the second communication terminal 20; the timestamp 3 is used to carry a peer transmit time to the define data packet, written by the second communication end 20; timestamp 4 is used to carry the noves that is not a data packet. The reception time is written by the first communication terminal 10. Further, the first communication end 10 can also be used to maintain the local status information, and read the timestamp 3 and the timestamp 4 from the definition packet, respectively, the transmission time record and the notation of the data packet, respectively. The received time record and records the local status information that makes it a packet, in which the two hardware time is written separately in the process of transmitting the next packet of the next packet to the second communication end 20. The timestamp 1 and timestamp 2 of the next packet, thereby supporting the network time calculation in the next communication round-trip process. Likewise, the target data packet in this embodiment may also be used as a packet of the previous data packet, and therefore, in the target data packet, the hardware time of the communication hardware with the aforementioned communication end 10 is carried out in the target data packet. Contains the other three hardware time, the target packet can be used as a write process in which the four hardware time in the aforementioned indexing data packet is adapted, and details are not described herein.

[0064] In this embodiment, other implementations can be acquired to hardware time in addition to obtaining the related hardware time by using hardware devices to write to a packet in a packet using hardware devices. For example, using hardware devices

[0065] / Send a packet, write hardware time to other objects (such as local files, etc.) other than the packet, thereby acquiring the related hardware time. Of course, for the hardware time required to provide the peer, it is also necessary to write to the deferred data packet by the alternate side to ensure that the local data is to calculate the network delay.

[0066] Thus, in addition to the above-described receiving / transmission time carrying the target data packet and the receiving data packet, in this embodiment, the first communication terminal 10 and the second communication end 20 can be targets. The packet and the definition data packet maintain the local status information, and the hardware time that occurs in the local end is recorded in the corresponding local status information without having to obtain the hardware time that occurred in the packet. For example, for the first communication terminal 10, the local status information of the target packet can be transmitted to the local status information of the target packet, and the local reception time will be written to the native data packet. In the local status information, for these two times, the first communication terminal 10 does not need to be acquired from the definition data packet, but can be directly recorded in the local status information, and the opposite end does not need to write these two times. A packet is made. Of course, in consideration of the second communication terminal 20 also needs to calculate the network delay between the communication terminal 10 from itself, the first communication terminal 10 can write these two times into the appropriate packet, A basis for providing the second communication end 20 as a calculation network.

[0067] Still figure 1 The communication round-trip process of exemplary is used, and the first communication terminal 10 can calculate the local and The network delay between the second communication end 20 is delayed. Wherein, the local reception time can be written to the deficient data packet by the communication hardware of the first communication terminal 10, and otherwise obtained by the above mentioned hardware when the communication hardware of the first communication end 10 is received. time. In an alternative implementation: The first communication end 10 can calculate the difference between the peer transmit time and the received time record of the target packet, as the peer processing time; calculates the local reception time and target data. The difference between the transmission time record of the package is the difference between the local end waiting time; the difference between the local wait time and the peer processing time, as the network delay between the local end and the peer. This implementation can be characterized as the following expression:

[0068] Network time delay = (the transmission time record of the local reception time - the target packet) - (the receiving time record of the target packet).

[0069] Since the calculation foundation of the network delay is hardware time, the accuracy of the network delay can be effectively improved, and these hardware times can be directly written directly from the communication hardware to the deferred packet, avoiding additional software overhead, which is advantageous Network performance improvement.

[0070] On this basis, reference figure 1 The first communication terminal 10 can adjust the network rate of the local end to the subsequent packets to congestion control based on the network delay. The congestion control ideas in this embodiment may be: When the network congestion occurs, the communication terminal in the network reduces the data transmission by controlling its own network rate, thereby improving the network congestion. For example, in the data center scene, network communication is performed between the servers in the data center, which is also transmitted to the switch to the switch by each communication terminal (server), and then forwards the switch to its designated peer (other server) According to this, in this embodiment, the network congestion control device provided in the respective servers can be deployed on each server included in the data center, thereby supporting each server to control its own network rate, when network congestion occurs, reducing the switcher The amount of data, which in turn alleviates the network congestion at the switch.

[0071]Further, in the present embodiment, each of the data packets in the network can carry the four hardware times mentioned in the present embodiment to identify the receipt / delivery time of the data packet during the communication round and trip, thereby running through a continuous number of communication round trips. In this way, both the first communication terminal 10 and the second communication terminal 20 can be used as the starting point of the communication round-trip, and the first communication end 10 can be used as a communication starting point (also corresponding to figure 1 The target packet is issued), calculating the network delay between it is between the second communication end 20; the second communication end 20 can also be used as a communication starting point (that is, corresponding to figure 1 The target packet is issued) to calculate the network delay in which it is between the first communication terminal 10, so that the first communication terminal 10 and the second communication end 20 can complete the congestion control of their own computation. .

[0072] Accordingly, in the present application embodiment, the hardware time can be used to record the transmission time and reception time of the target data packet in the single communication round and trip and the respective authentication data packets thereof, and write these hardware time to the definition data. In this case, in this way, the network delay can be calculated based on the respective hardware time carried in the packet, and the network congestion and adjust the network rate of the local end is known based on the network time. In the present application, the network delay is calculated based on the hardware time, and the accuracy of the network delay can be effectively improved, so that the network congestion is more accurate according to the network, and the network rate of the end of the end can be extended according to the network. Thereby achieving more accurate congestion control.

[0073] In the above or described embodiment, the first communication terminal 10 can adjust the window specification of its congestion window based on the network delay between the second communication end 20, to adjust the network rate of the local end. Among them, the congestion window is a conventional term in the field of network congestion control, which is no longer explained here. In addition, a specific scheme for adjusting the window specification of the congestion window will be described in the following, in the present embodiment, the adjusted congestion window will be used as the starting point of the explanation.

[0074] In this embodiment, two speed control modes can be configured for the first communication end 10: one is based on the speed control mode of the send window; the other is based on the speed mode of the delay package.

[0075] Based on this, the first communication terminal 10 is for the case where the window specification of the adjusted congestion window is greater than or equal to the maximum transmission unit, and the network rate of the local transmission window is used to control the network rate of the transmitted window. In this speed mode, the adjusted congestion window can be assigned to the send window, and the sending window is used to make a transmission operation of the next data packet after the send window. Among them, the sending window is also a conventional term in the field of network congestion control, which is no longer explained here. Further, the maximum transmission unit may be the size of the maximum packet of the first communication end 10, for example, in the data center scene, the first communication end 10 and the switch can be conventionally a maximum transmission unit.

[0076] In this embodiment, the first communication terminal 10 can be used to control the network rate of the host based on the window specification of the adjusted congestion window is less than the maximum transmission unit. In this speed mode, the send window can be assigned to the maximum transmission unit; and the adjusted congestion window can be converted to the theoretical happly lapse of the delayed package operation; in accordance with the theoretical hair package time delay and send window on subsequent packets Delay happlings to control the network rate of the local end. In an optional implementation: theoretical hair pack time = maximum transmission unit / (congestion window * network bandwidth). In addition, in the actual application, the timer can be deployed in the first communication terminal 10 for supporting the delayed package operation. Based on the timer, the first communication terminal 10 can initiate the timer when the first communication terminal 10 can be transmitted after receiving the data packet after receiving the default data packet, when receiving the next packet after receiving the packet. After the theoretical hair package can be latenned after startup, the first communication terminal 10 can issue the next packet in accordance with the reminder, thereby implementing the delayed package operation of the next packet. It will be appreciated that in a speedy mode based on the delay, it is to convert the congestion window to the theoretical hair pack lapse to ensure the normal passage of the maximum transmission unit.

[0077] In this embodiment, the first communication end 10 is used, after determining the window specification of the send window, the slow start-like control algorithm can be used to calculate the network rate of the local end, the present embodiment to be applied to the transmission window. The speed control algorithm is not limited, nor will the specific process of the algorithm will be detailed.

[0078] Accordingly, in this embodiment, two types of control modes based on the transmission window and the delay package can be supported, so that the appropriate speed control mode can be selected according to the window specification of the adjusted congestion window, so that the network rate of the local end The regulatory particle size is more meticulous, and more accurate congestion control can be achieved.

[0079] In the above or described embodiment, the first communication terminal 10 can adjust the congestion window of the local end in accordance with the network delay in which the network is between the second communication end 20, thereby implementing the control scheme in the foregoing embodiment. In this embodiment, a variety of implementations can be used to perform the operation of adjusting the congestion window. For example, some conventional implementations may be: When the network delay is greater than the specified time delay threshold, the sew window processing is performed on the congestion window of the local end; when the network is extended to the specified time delay threshold, the congestion window of the local end is performed. Window processing.

[0080] However, in the case where the inventors have found that the conventional conventional congestion window adjustment effects are insufficient, especially when the window treatment, often excessive windowing, resulting in excessive control speed of the first communication end 10, Waste network transmission time.

[0081] To this end, in the present embodiment, the first communication terminal 10 can obtain the actual happly delay corresponding to the recent delayed happfaction operation at the end of the network at the network, and the recent delay is obtained by the last time delay. The time interval between the occurrence time between the hair package operation is smaller than the actual happly delay, then adjust the congestion window of the local end with the maximum transmission unit that the window specification is not smaller than the host, adjust the homework window; according to the adjusted congestion window, determine this The network rate of the end is congested to subsequent packets; wherein the recessioning package operation is a window specification that is less than the maximum transmission unit of the window specification of the hostel, reference. It should be understood that the most recent delayed happbess operation may occur during the transmission of the Nth data packet before the packet, where N can be arbitrary positive integers, that is, the first communication terminal 10 is transmitted. The nep packet is that the congestion window is smaller than the maximum transmission unit so that the delay happbess operation is triggered. The Nth Nacket and the data packets between the aforementioned indexing data packets are employed based on the transmission window based on the transmission window. That is, the congestion window of the first communication end 10 is not below the maximum transmission unit during those packet transmission.

[0082] Among them, the actual happly delay in this embodiment refers to the actual happly waiting time during the recent delay in the operation. There are two situations here: one is based on the control mode of the delay package (for example, the aforementioned timer), in which case the actual happly is generally equal to the theoretical hair package; the other is based on In this case, in this case, in this case, in this case, in this case, the actual hair pack is often much larger than the theoretical hair premature, for example, when the timer is too busy, the timer cannot be According to the theoretical hair package, the hair bag reminder is issued, causing the actual hair pack to extend long, the theoretical hair package is delayed as 5 microseconds, the actual hair bag may be 100 milliseconds. In practical applications, if there is an abnormality based on the control mode based on the delayed bag, the gap between the delay in theoretical hair packing time is usually an index level or even higher, the gap is very large.

[0083] As described above, in the present embodiment, during the adjustment of the congestion window, increase the time judgment based on the actual happly delay, and may be avoided in a considerable period of time in a considerable period of time. Call the speed mode based on the delay package (to undertake the above, that is, the call timer can be avoided as much as possible). This is due to the abnormal control mode based on the speed of the delay, the actual hair latency will be relatively long, so that the above judgment result will be in a period of time after the recent delayed package operation. "The time interval between the last time delayed happbess operation is smaller than the actual hair package", "thus, the congestion window of the first communication terminal 10 will not be adjusted to the maximum in a considerable period of time. The transmission unit is below, thereby avoiding tuning up the speed scheduled mode based on the delay.

[0084] In this embodiment, the process of adjusting the congestion window of the host is adjusted in the maximum transmission unit that is not smaller than the local transmission unit supported by the window specification, the first communication terminal 10 can calculate the current terminal in accordance with the preset multiplied window logic. The congestion window performs a window specification after the multiplication window; if the calculated window specification is less than or equal to the maximum transmission unit, the congestion window is assigned to the maximum transmission unit to obtain the adjusted congestion window; if the calculated window specification is greater than To maximize the transfer unit, the current congestion window performs a multiplier window processing to obtain the adjusted congestion window. Among them, the multiplier window logic can use conventional logic in the art, which is no longer disclosed. As described above, in the present embodiment, the window window of two congestion windows can be provided: one is a multiplier window; the other is to reduce the maximum transmission unit (less than the transition window amplitude of the multiplier window). Based on this, the appropriate window size can be selected according to the window specifications of the existing congestion window, and the frequency of the multiplier window can be reasonably controlled.

[0085] In this embodiment, if the time interval between the occurrence time of the last delayed happbess operation is greater than the actual happly delay, the control speed mode based on the delay package is normal or the delay-based control mode is abnormality. In the case, the first communication end 10 has not been called for a long period of time, and therefore, in this judgment result, the congestion window can be permitted to obtain a modified congestion window. . That is, the congestion window can be permitted for the congestion window under this judgment. It should be understood that in this case, the multiplication window processing may cause the congestion window of the first communication end 10 to fall below, thereby triggering the speed-based transmission mode based on the delayed package, but in this case The speed mode of the delay happbess is in normal state or even in an abnormal state but has been not called for a long time.

[0086] Further, in the present embodiment, in the adjustment of the congestion window, in addition to the judgment logic based on the actual happly, it can be determined before the end of the window is greater than the network delay. If yes, Performing the aforementioned judgment logic based on actual happly delays; if not, the adjustment of the congestion window can be prohibited to ensure maximum window processing in the network delay.

[0087] In this embodiment, if the network extends to the specified time delay threshold, the first communication terminal 10 can perform an overhead operation on the congestion window. In this embodiment, the multiplication window mode and an additive window mode may be provided. Based on this, if the window specification of the conventional congestion window is less than the slow start threshold, the multiplial window mode can be employed; The window specification of the congestion window is greater than the slow start threshold, and the additive window mode can be used. Among them, the slow start threshold is a conventional term in the art, which is no longer explained, and the multiplier window and an additive window can also be detailed in the art.

[0088] Accordingly, in this embodiment, the adjustment strategy for the existing congestion window can be determined based on the network time, and, when determining that the existing congestion window performs a windowing process, it can be based on the most recent delayed package operation. The actual hair presence, timely discovery whether there is an abnormality based on delayed happlings, and more reasonably control the frequency of multiplied window operation, and reasonable determination of the windowing amplitude of the existing congestion window, this can be effectively guaranteed The robustness of the congestion window adjustment scheme, thereby reducing the effect of delayed happiness based on delayed happiness on congestion control effect.

[0089] image 3 A flow diagram of a network congestion control method provided by another exemplary embodiment of the present application. refer to image 3 This method can include:

[0090]Step 300, receive the indexed data packet returned to the target data packet transmitted for the local end, and the received time record of the peer transmit time and the target packet included in the data packet, uses hardware time;

[0091] Step 301, obtaining the hardware time when the local terminal receives the definition of the data packet, as the local reception time corresponding to the data packet;

[0092] Step 302, get the hardware time when the local transmission of the target packet is acquired, as a transmission time record of the target packet

[0093] Step 303: The network delay between the local and the peer is calculated based on the local reception time and the transmission time record and the transmission time record of the target packet, and the transmit time record of the target packet, and the transmit time record.

[0094] Step 304, based on the network delay, adjust the network rate of the local end to congestion control of the subsequent packet.

[0095] The network congestion control method provided in this embodiment can be applied to figure 1 Any communication terminal in the communication system. Communication hardware, such as NIC, etc. can be assembled in the communication terminal. Based on this, in an alternative embodiment, step 301 can include: in the case where the received data packet is received, the current hardware time writes the current hardware time to a clear data packet as the local reception time.

[0096] In an alternative embodiment, the write scheme of the other hardware time in the packet can be:

[0097] In the process of transmitting the target packet to the peer, the hardware time when the target packet is written to the target packet by the communication hardware, and the hardware time is written to the transmission time record of the target packet as the transmission time of the target packet. Creating a packet;

[0098] Wherein, the hardware time of the peer to receive the hardware time when the target data packet is received, the received time record as the target packet is received as the target packet; the hardware time written to the transmission that the data package will be sent as a result. The peer transmission time.

[0099] In an alternative embodiment, the scheme of the network delay between the local end and the peer may be:

[0100] The difference between the peer transmit time and the received time record of the target packet is calculated as the peer processing time;

[0101] The difference between the local reception time and the transmission time record of the target packet is calculated as the local wait time;

[0102] The difference between the local wait time and the peer processing time is delayed as the network between the local end and the peer.

[0103] Figure 4 A network rate control process is performed for a network rate control process based on another exemplary embodiment of the present application. Among them, the results of the adjusted congestion window will be described later in the following. refer to Figure 4 , In the network rate control process based on the adjusted congestion window, may include:

[0104] Step 401, determine if the adjusted congestion window is less than the maximum transmission unit. However, step 402 is performed, i.e., the speed mode based on the delay package, otherwise, step 305 is performed, i.e., the control speed mode based on the sending window is employed.

[0105] Step 402: Convert the adjusted congestion window to the theoretical hair pack time delay corresponding to the delay package operation, and record the local state of the congestion window. Alternatively, theoretical hair latency = maximum transmission unit / (congestion window * network bandwidth).

[0106] Step 403: Perform a delayed package operation on subsequent packets in accordance with the theoretical hair packution delay and sending a window to control the network rate of the local end. In an optional implementation: The timer can be deployed in this end to support the delayed package operation. Based on the timer, the trigger time of the timer can be configured in accordance with the theory. The send window can be assigned to the maximum transmission unit.

[0107] Step 404: When receiving the reception of the packet, it is necessary to send the next packet, start the timer, and the timer can be launched after starting after starting, so that a reminder is issued, so that the local end can be issued in accordance with a reminder The next packet is implemented to implement the delayed package operation of the next packet. It will be appreciated that in a speedy mode based on the delay, it is to convert the congestion window to the theoretical hair pack lapse to ensure the normal passage of the maximum transmission unit. The actual trigger time of the timer can also be recorded, thereby obtaining the actual happly.

[0108] Step 405: Assign a value to the send window using the adjusted congestion window.

[0109] Step 406: Control the network rate of the local end based on the send window (and theoretical hair pack delay).

[0110] In an optional implementation, adjust the process of the congestion window, which may include:

[0111] In the case where the network delay is greater than the specified delay threshold, the actual hair pretension corresponding to the last delayed happly operation is obtained;

[0112] If the time interval between the occurrence time of the last delayed happbess operation is smaller than the actual happlution delay, the congestion window of the local end is adjusted by the maximum transmission unit that the window specification is not smaller than the local end.

[0113] According to the adjusted congestion window, determine the network rate of this end to congestion control of the subsequent packet;

[0114] Where, the delayed happbess operation is triggered in the case where the window specification of the historical congestion window of the local end is triggered with the maximum transmission unit.

[0115] Figure 5 A schematic diagram of a congestion window adjustment process provided for another exemplary embodiment of the present application. refer to Figure 5 The process of adjusting the congestion window described above, can be specifically included:

[0116] Step 501: Calculate the delay threshold, the calculation method of the delay threshold does not limit, for example, according to the number of network hops, end-to-end measurements, the number of current flows, etc., calculate the delay threshold. .

[0117] Step 502: Judging whether the network delay is greater than the target delay, then perform step 503, otherwise, step 509 is performed.

[0118] Step 503: It is determined whether the window interval is greater than the network, then step 504 is performed. The window interval can refer to the time interval between the last window time to the current time; otherwise, the congestion window adjustment work can be prohibited.

[0119] Step 504: Determines whether the time interval between the last time delayed happbess operation is greater than the actual happly delay corresponding to the most recent delayed package operation, then performing step 506, otherwise performing step 505.

[0120] Step 505: Calculate the window specification of the current congestion window to the current congestion window in accordance with the preset multiplier window logic; if the calculated window specification is less than or equal to the maximum transmission unit, step 507 is performed, otherwise the step 506.

[0121] Step 506: The window is reduced.

[0122] Step 507: Use the maximum transmission unit to assign the congestion window.

[0123] Step 508: Use the congestion window to give the slow start threshold assignment.

[0124] Step 509: Judging whether the existing congestion window is less than the slow start threshold, then performs step 510, otherwise, step 511 is performed.

[0125] Step 510: Window multiplication growth.

[0126] Step 511: Window additive growth.

[0127] It is worth mentioning that the technical details of the various embodiments of the network congestion control method may refer to the related description of the first communication end in the foregoing system embodiment, which is not described herein, but this should not be described here. Causes the loss of the scope of this application.

[0128] Image 6 A flow diagram of another network congestion control method provided by another exemplary embodiment of the present application. refer to Image 6 This method can include:

[0129] Step 600, in the case where the network time between the local end and the peer is larger than the specified time delay threshold, the actual happly delay corresponding to the last delayed package operation is obtained;

[0130] In step 601, if the time interval between the occurrence time of the last delayed happbess operation is smaller than the actual happlution delay, the homage window is adjusted by the maximum transmission unit that the window specification is not smaller than the local end.

[0131] Step 602, according to the adjusted congestion window, determine the network rate of the local end to congestively control the local end;

[0132] Where, the delayed happbess operation is triggered in the case where the window specification of the historical congestion window of the local end is triggered with the maximum transmission unit.

[0133] The network congestion control method provided in this embodiment is image 3 The related network congestion control method differs from the network time delay involved in the network congestion control method in this embodiment. image 3 The network delay calculation method provided in the related embodiments is obtained. In this embodiment, other calculation methods can also be employed to determine the network delay, for example, the conventional system time to calculate the network delay.

[0134] The network congestion control method provided in this embodiment can determine the adjustment strategy for the existing congestion window according to the network time, and, in the case where it is determined to perform windowing processing on the existing congestion window, it can be based on the most latency. The actual lamination delay in the operation is timely discovered whether there is an abnormality based on the calorie-based control mode, thereby more reasonably controlling the frequency of the multiplied window operation, and reasonably determines the windowing window of the existing congestion window, this can Effectively guarantee the robustness of the congestion window adjustment scheme, thereby reducing the effect of delayed happiness of delayed happiness on congestion control effects.

[0135] In an alternative embodiment, the steps adjust the congestion window of the local end as the maximum transmission unit that the window specification is not smaller than the local end, can include:

[0136] Calculate the window specification after the current congestion window of this end according to the preset multiplier window logic;

[0137] If the calculated window specification is less than or equal to the maximum transmission unit, the congestion window is assigned to the maximum transmission unit to obtain the adjusted congestion window;

[0138] If the calculated window specification is greater than the maximum transmission unit, the current congestion window executes the multiplier window processing to obtain the adjusted congestion window.

[0139] In an alternative embodiment, the method can also include:

[0140] If the time interval between the occurrence time of the last delayed happbess operation is greater than the actual hair premature delay, the current congestion window is executed on the current congestion window to obtain the adjusted congestion window.

[0141] In an alternative embodiment, the steps determine the network rate of the local end according to the adjusted congestion window, which may include:

[0142]If the window specification of the adjusted congestion window is greater than the maximum transmission unit, the send window of the local end is assigned to the adjusted congestion window; based on the transmission window to control the network rate of the local end;

[0143] If the window specification of the adjusted congestion window is less than the maximum transmission unit, the send window of the local end is assigned to the maximum transmission unit, and the adjusted congestion window is converted to the theoretical happiness of the delayed package operation; in accordance with the theory Delay and sending window perform delayed package operations on subsequent packets to control the network rate of the local end;

[0144] Among them, the timer is used to implement the delayed hair pack operation, and in the case where the timer is abnormal, the actual hair latency is greater than the theoretical hair labeling.

[0145] It is worth mentioning that the technical details of each of the various embodiments of the network congestion control method may be refer to the related description of the first communication end in the foregoing system embodiments and image 3 Related description in related embodiments, in order to save space, there is no further detail, but this should not cause loss of the scope of this application.

[0146] Figure 7 A flow diagram of a method of determining a network delay provided by further exemplary embodiments of the present application. refer to Figure 7 This method can include:

[0147] Step 700, receive the indexed data packet returned to the target data packet transmitted for the local end, and the received time record of the peer transmit time and the target data packet included in the packet is used;

[0148] Step 701, obtain the hardware time when the local end receives the hardware time when the data packet is received, and the local reception time corresponding to the data packet;

[0149] Step 702, obtain the hardware time when the local transmission of the target data packet is acquired, as the transmission time record of the target packet;

[0150] Step 703, calculate the network delay between the local end and the peer to calculate the network delay between the local terminal reception time and the transmission time record and the transmit time of the target packet, and the transmit time record corresponding to the data packet.

[0151] In this embodiment, the network delay is determined, and the hardware time can be used to record the transmission time and reception time experienced by the target data packet in the single communication round and from the respective transmission time and reception time they have experienced, and write these hardware time. In this way, the network delay can be calculated based on the respective hardware times that the data packets can be calculated. In this embodiment, the network delay is calculated based on the hardware time, and the accuracy of the network delay can be effectively improved. Compared to the foregoing embodiments, the network time delayed and unlimited for network congestion control is used for network congestion control, and the network delay obtained in this embodiment can also be used for other scenarios, for example, fault monitoring, etc.

[0152] In an alternative embodiment, step 701 can include:

[0153] In the case where the data packet is received, the current hardware time is written to a clear data packet using the communication hardware using the local end, and is used as the local reception time.

[0154] In an alternative embodiment, the method can also include:

[0155] In the process of transmitting the target packet to the peer, the hardware time when the target packet is written to the target packet by the communication hardware, and the hardware time is written to the transmission time record of the target packet as the transmission time of the target packet. Creating a packet;

[0156] Wherein, the hardware time of the peer to receive the hardware time when the target data packet is received, the received time record as the target packet is received as the target packet; the hardware time written to the transmission that the data package will be sent as a result. The peer transmission time.

[0157] In an alternative embodiment, the step of calculating the network delay between the local end and the peer may include:

[0158] The difference between the peer transmit time and the received time record of the target packet is calculated as the peer processing time;

[0159] The difference between the local reception time and the transmission time record of the target packet is calculated as the local wait time;

[0160] The difference between the local wait time and the peer processing time is delayed as the network between the local end and the peer.

[0161] It is worth explanating that the technical details of each of the embodiments of the network delay determination method may be referred to the relevant description of the network delay process with respect to the first communication end, which may be referred to in the foregoing system embodiment. Take later, this should not cause loss of the scope of this application.

[0162] It should be noted that in some of the above-described embodiments and the description of the drawings, multiple operations that appear in a particular order, but it should be understood that these operations may not be performed in accordance with their order in this article. Or parallel execution, the serial number of operations such as 501, 502, etc., is merely used to distinguish various different operations, and the sequence number does not represent any execution order. Additionally, these processes can include more or less operations, and these operations can be performed in order or in parallel. It should be noted that "first", "second", etc., is used to distinguish between different applications, messages, etc., does not represent the order of order, and do not limit "first" and "second" Different types.

[0163] Figure 8 A structural diagram of a communication end provided by the further exemplary embodiment of the present application. like Figure 8 As shown, the meter communication end includes: memory 80, processor 81, and communication hardware 82.

[0164] Processor 81, coupled to memory 80 and communication hardware 82 for performing computer programs in memory 80 for:

[0165] The authenticated data packet returned by the target data packet transmitted for the local end is received by the communication hardware 82, and the received time record of the peer transmit time and the target packet included in the data packet is determined, and the hardware time is employed;

[0166] The hardware time when the local reception is received when the data packet is received, and the local reception time corresponding to the data packet;

[0167] Gets the hardware time when the local transmission of the target packet is obtained, as the transmission time record of the target packet;

[0168] The network delay between the local and the peer is calculated based on the local reception time and the pending time record and the transmission time record of the data packet, and the transmit time record of the target packet.

[0169] Based on network delay, adjust the network rate of the local end to congestion control on subsequent packets.

[0170] In an alternative embodiment, the processor 81 can be specifically available for:

[0171] In the case where the data packet is received, the current hardware time writes the current hardware time to a clear data packet using the communication hardware, and is used as the local reception time.

[0172] In an alternative embodiment, processor 81 can also be used in:

[0173] In the process of transmitting the target packet to the peer, the hardware time when the target packet is written to the target packet by the communication hardware, and the hardware time is written to the transmission time record of the target packet as the transmission time of the target packet. Creating a packet;

[0174] Wherein, the hardware time of the peer to receive the hardware time when the target data packet is received, the received time record as the target packet is received as the target packet; the hardware time written to the transmission that the data package will be sent as a result. The peer transmission time.

[0175] In an alternative embodiment, the processor 81 can be used in:

[0176] The difference between the peer transmit time and the received time record of the target packet is calculated as the peer processing time;

[0177] The difference between the local reception time and the transmission time record of the target packet is calculated as the local wait time;

[0178] The difference between the local wait time and the peer processing time is delayed as the network between the local end and the peer.

[0179] In an alternative embodiment, the processor 81 adjusts the network rate of the local terminal based on the network delay, and can be used in the congestion control process of the subsequent packets.

[0180] In the case where the network delay is greater than the specified delay threshold, the actual hair pretension corresponding to the last delayed happly operation is obtained;

[0181] If the time interval between the occurrence time of the last delayed happbess operation is smaller than the actual happlution delay, the congestion window of the local end is adjusted by the maximum transmission unit that the window specification is not smaller than the local end.

[0182] According to the adjusted congestion window, determine the network rate of this end to congestion control of the subsequent packet;

[0183] Where, the delayed happbess operation is triggered in the case where the window specification of the historical congestion window of the local end is triggered with the maximum transmission unit.

[0184] In an alternative embodiment, the processor 81 adjusts the congestion window of the local end as the maximum transmission unit that is not less than the local end support, can be used in:

[0185] Calculate the window specification after the current congestion window of this end according to the preset multiplier window logic;

[0186] If the calculated window specification is less than or equal to the maximum transmission unit, the congestion window is assigned to the maximum transmission unit to obtain the adjusted congestion window;

[0187] If the calculated window specification is greater than the maximum transmission unit, the current congestion window executes the multiplier window processing to obtain the adjusted congestion window.

[0188] In an alternative embodiment, processor 81 can also be used in:

[0189] If the time interval between the occurrence time of the last delayed happbess operation is greater than the actual hair premature delay, the current congestion window is executed on the current congestion window to obtain the adjusted congestion window.

[0190] In an alternative embodiment, the processor 81 can determine the network rate of the local network in accordance with the adjusted congestion window, which can be used for:

[0191] If the window specification of the adjusted congestion window is greater than the maximum transmission unit, the send window of the local end is assigned to the adjusted congestion window; based on the transmission window to control the network rate of the local end;

[0192] If the window specification of the adjusted congestion window is less than the maximum transmission unit, the send window of the local end is assigned to the maximum transmission unit, and the adjusted congestion window is converted to the theoretical happiness of the delayed package operation; in accordance with the theory Delay and sending window perform delayed package operations on subsequent packets to control the network rate of the local end;

[0193] Among them, the timer is used to implement the delayed hair pack operation, and in the case where the timer is abnormal, the actual hair latency is greater than the theoretical hair labeling.

[0194] It is worth mentioning that the technical details of each of the embodiments of the communication terminal may refer to the related description of the first communication end in the foregoing system embodiment, which will not be described herein, but this should not be made. Loss of protection range.

[0195] In another possible design, based on Figure 8 The structure of the communication end shown, the communication terminal can also be used for execution Image 6 Related network congestion control logic. In this case, the processor 81 can be used in:

[0196] When the network delay between the local end is greater than the specified time delay threshold, the actual happly delay corresponding to the last delayed happly operation is obtained;

[0197] If the time interval between the occurrence time of the last delayed happbess operation is smaller than the actual happlution delay, the congestion window of the local end is adjusted by the maximum transmission unit that the window specification is not smaller than the local end.

[0198] According to the adjusted congestion window, determine the network rate of the local end to congestion control on the end;

[0199] Where, the delayed happbess operation is triggered in the case where the window specification of the historical congestion window of the local end is triggered with the maximum transmission unit. Among them, network delay is not limited to calculating based on hardware time.

[0200] In an alternative embodiment, the processor 81 adjusts the congestion window of the local end as the maximum transmission unit that is not less than the local end support, can be used in:

[0201] Calculate the window specification after the current congestion window of this end according to the preset multiplier window logic;

[0202] If the calculated window specification is less than or equal to the maximum transmission unit, the congestion window is assigned to the maximum transmission unit to obtain the adjusted congestion window;

[0203] If the calculated window specification is greater than the maximum transmission unit, the current congestion window executes the multiplier window processing to obtain the adjusted congestion window.

[0204] In an alternative embodiment, processor 81 can also be used in:

[0205] If the time interval between the occurrence time of the last delayed happbess operation is greater than the actual hair premature delay, the current congestion window is executed on the current congestion window to obtain the adjusted congestion window.

[0206] In an alternative embodiment, the processor 81 can determine the network rate of the local network in accordance with the adjusted congestion window, which can be used for:

[0207] If the window specification of the adjusted congestion window is greater than the maximum transmission unit, the send window of the local end is assigned to the adjusted congestion window; based on the transmission window to control the network rate of the local end;

[0208] If the window specification of the adjusted congestion window is less than the maximum transmission unit, the send window of the local end is assigned to the maximum transmission unit, and the adjusted congestion window is converted to the theoretical happiness of the delayed package operation; in accordance with the theory Delay and sending window perform delayed package operations on subsequent packets to control the network rate of the local end;

[0209] Among them, the timer is used to implement the delayed hair pack operation, and in the case where the timer is abnormal, the actual hair latency is greater than the theoretical hair labeling.

[0210] It is worth mentioning that in this possible design, the technical details regarding the embodiments of the communication end can refer to the aforementioned Image 6 Description in Examples of Related Methods, in order to save space, there is no further detail, but this should not cause loss of this application.

[0211] In yet another possible design, based on Figure 8 The structure of the communication end shown, the communication terminal can also be used for execution Figure 7 Related network delay determines logic. In this case, the processor 81 can be used in:

[0212] The authenticated data packet returned by the target data packet transmitted for the local end is received by the communication hardware 82, and the received time record of the peer transmit time and the target packet included in the data packet is determined, and the hardware time is employed;

[0213] The hardware time when the local reception is received when the data packet is received, and the local reception time corresponding to the data packet;

[0214] Gets the hardware time when the local transmission of the target packet is obtained, as the transmission time record of the target packet;

[0215] The network delay between the local end and the peer is calculated based on the local reception time and the pending time of the data packet and the transmission time and the transmit time record of the target packet, and the received time record.

[0216] In an alternative embodiment, the processor 81 can be specifically available for:

[0217] In the case where the data packet is received, the current hardware time is written to a clear data packet using the communication hardware using the local end, and is used as the local reception time.

[0218] In an alternative embodiment, processor 81 can also be used in:

[0219] In the process of transmitting the target packet to the peer, the hardware time when the target packet is written to the target packet by the communication hardware, and the hardware time is written to the transmission time record of the target packet as the transmission time of the target packet. Creating a packet;

[0220] Wherein, the hardware time of the peer to receive the hardware time when the target data packet is received, the received time record as the target packet is received as the target packet; the hardware time written to the transmission that the data package will be sent as a result. The peer transmission time.

[0221] In an alternative embodiment, the processor 81 can be used in the process of calculating the network delay between the local end and the peer

[0222] The difference between the peer transmit time and the received time record of the target packet is calculated as the peer processing time;

[0223] The difference between the local reception time and the transmission time record of the target packet is calculated as the local wait time;

[0224] The difference between the local wait time and the peer processing time is delayed as the network between the local end and the peer.

[0225] It is worth mentioning that in this possible design, the technical details regarding the embodiments of the communication end can refer to the aforementioned Figure 7 Description in Examples of Related Methods, in order to save space, there is no further detail, but this should not cause loss of this application.

[0226] Further, such as Figure 8 As shown, the communication end further includes: other components such as power supply components 83. Figure 8 It is only to give some components only, and it does not mean that the communication terminal includes Figure 8 The components shown are shown.

[0227] Accordingly, the present application embodiment further provides a computer readable storage medium stored with a computer program, and the computer program can implement each of the steps that can be performed by the communication end in the above method embodiment.

[0228] Above Figure 8 The memory is used to store the computer program and can be configured to store other data to support operations on the computing platform. Examples of this data include instructions, contact data, phone book data, messages, pictures, video, and the like for any application or method for operating on a computing platform. Memory can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), can be erased programmable Read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, disk or disc.

[0229] Above Figure 8 Communication hardware in the middle can be configured to facilitate communication between the communication terminal and the peer or wireless mode. Communication ends can access communication standards based wireless networks such as mobile communication networks such as WiFi, 2G, 3G, 4G / LTE, 5G, or combinations thereof. In an exemplary embodiment, communication hardware receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication hardware further includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be achieved based on RFI (RFID) technology, infrared data association (IRDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology, and other techniques.

[0230] Above Figure 8 The power components in the power supply components provide power for various components of the power components. The power component can include a power management system, one or more power supplies, and other components associated with the device generated, managed, and allocated power components.

[0231] Those skilled in the art will appreciate that embodiments of the present application can be provided as a method, system, or computer program product. Therefore, the present application may employ a full hardware embodiment, a fully software embodiment, or in the form of a combination of software and hardware embodiments. Moreover, the present application may employ a computer program product that includes a computer available storage medium (including, but not limited to, disk memory, CD-ROM, optical memory, etc.) in one or more computers.

[0232] The present application is described with reference to the method, device (system), and flowcharts and / or block diagrams of the computer program product, in accordance with the present application embodiment. It should be understood that each of the flowcharts and / or blocks in the flowchart and / or block diagram can be implemented by a computer program command, and the binding of the flow and / or box in the flowchart and / or block diagram. These computer program instructions can be provided to generic computers, dedicated computers, embedded processes, or other programmable data processing devices to generate a machine such that instructions executed by the processor of the computer or other programmable data processing device. Implementation in the process Figure one Process or multiple processes and / or boxes Figure one Apparatus specified in a plurality of boxes or multiple boxes.

[0233] These computer program instructions can also be stored in a computer readable memory capable of booting a computer or other programmable data processing device in a particular manner, making the instructions stored in the computer readable memory generate a manufacturing product of the instruction device, which Device is implemented in the process Figure one Process or multiple processes and / or boxes Figure one The function specified in the box or multiple boxes.

[0234] These computer program instructions can also be loaded on a computer or other programmable data processing device such that a series of steps are performed on a computer or other programmable device to generate a computer implemented process, thereby executing on a computer or other programmable device. The instruction is provided for implementation Figure one Process or multiple processes and / or boxes Figure one The step of the function specified in multiple boxes or multiple boxes.

[0235] In a typical configuration, the computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0236] Memory may include a non-permanent memory, random access memory (RAM), and / or non-volatile memory (ROM) or flash memory (Flash Ram) in a computer readable medium. Memory is an example of a computer readable medium.

[0237]Computer readable media includes permanent and non-permanent, movable and non-removable media to be stored by any method or technology. The information can be a computer readable instruction, data structure, program module or other data. Examples of the computer's storage medium include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrical erasure programmable read-only memory (EEPROM), flash memory or other memory technology, read-only disc read only memory (CD-ROM), digital multi-function CD (DVD) or other optical storage, Magnetic cassette tape, tape magnetic disk storage or other magnetic storage device or any other non-transmission medium, can be used to store information that can be accessed by the compute device. According to the definition in this article, the computer readable medium does not include a temporary computer readable medium such as a modulated data signal and carrier.

[0238] It will also be noted that the term "comprising", "comprising" or any other variable is intended to encompass non-exclusive contained contained, so that the process, method, product, or device including a series of elements, not only those elements, but also include Other elements that are not explicitly listed, or include elements inherent to such processes, methods, goods, or equipment. In the absence of more restrictions, the elements defined by the statement "include a ...", and there is no other same elements in the process, method, product, or device including the element.

[0239] It is not intended to limit the present application as described above. For those skilled in the art, the present application can have various changes and changes. Any modification, equivalent replacement, improvement, etc. according to the spirit and principles of this application shall be included within the scope of the present application.