WO2023087639A1 - Data packet sending method and apparatus, electronic device, and storage medium - Google Patents

Abstract

A data packet sending method and apparatus, an electronic device, and a storage medium, the method comprising: determining a minimum network transmission delay within a predetermined time window at a current time; determining a unit packet transmission delay increment between network transmission delays of a number N of packets sent at the same time, N being greater than or equal to 2; according to the ratio of the minimum network transmission delay within the predetermined time window at the current time and the unit packet transmission delay increment between the N packets, determining a target number of packets to be sent at the current time; determining a simultaneous transmission number of data packets to be sent at the same time on the basis of a network congestion level at the current time and the target number of data packets to be sent at the same time, so as to send data packets according to the simultaneous transmission number.

Description

Method, device, electronic device and storage medium for sending data packets

Cross References to Related Applications

This application is based on a Chinese patent application with application number 202111367459.1 and a filing date of November 18, 2021, and claims the priority of this Chinese patent application. The entire content of this Chinese patent application is hereby incorporated by reference into this application.

technical field

The present disclosure relates to the technical field of data transmission, and in particular to a method, device, electronic device and storage medium for sending data packets.

Background technique

Today's Internet is becoming more and more timely, and the real-time interaction requirements of various emerging applications have stricter requirements on the transmission delay of their data. It is necessary to ensure that the currently produced data reaches the peer within a specific time range; otherwise, it exceeds a certain time limit. Data with a time threshold will be actively discarded to avoid affecting the user's real-time experience. For example, VR cloud games require that the transmission delay of pictures and sounds be controlled within 50 milliseconds to ensure the timeliness and stability of data transmission and avoid discomfort symptoms such as dizziness. At the same time, online conferences, real-time communications, etc. also need to strictly control the delay of call content transmission to ensure user interaction and continuity.

Congestion control algorithms customized for low-latency transmission, such as BBR, detect the bottleneck bandwidth in the current network path by periodically oversending data (an equivalent sliding window greater than the bandwidth detection value), real-time and more accurate bandwidth detection It obtains a higher bandwidth throughput, but periodic oversending data will make the data inflow speed of the network bottleneck node faster than the speed of network consumption, introduce unnecessary queuing delay to network transmission, and even cause transmission congestion. , does not meet the basic requirements of low-latency transmission.

Contents of the invention

According to an embodiment of the first aspect of the present disclosure, a method for sending data packets is provided, including: determining the minimum network transmission delay within a predetermined time window at the current moment; determining the network transmission of N data packets sent simultaneously The unit data packet transmission delay increment between the delays, wherein, N is greater than or equal to 2; according to the minimum network transmission delay within the predetermined time window at the current moment and the unit data packet transmission between the N data packets The ratio of the delay increment determines the target number of data packets to be sent at the current moment; based on the congestion level of the network at the current moment and the number of target data packets to be sent at the same time, the number of data packets to be sent at the same time is determined to be sent at the same time according to the number of simultaneous transmissions Send packets.

According to an embodiment of the first aspect of the present disclosure, sending the data packets according to the simultaneous sending quantity includes: sending the data packets simultaneously in a burst mode.

According to an embodiment of the first aspect of the present disclosure, determining the minimum network transmission delay within the predetermined time window at the current moment includes: obtaining the receiving time of the ACK packet received within the predetermined time window at the current moment and the time of the ACK packet The sending time of the corresponding data packet; calculating the time difference between the receiving time of the ACK packet and the corresponding sending time of the ACK packet, and using the minimum time difference in the calculated time difference as the minimum network transmission delay.

According to an embodiment of the first aspect of the present disclosure, determining the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time to the receiving end includes: according to the N data packets returned from the receiving end for the N The sending time recorded in the ACK packet of the N data packets and the current moment determine the respective network transmission delays of the N data packets; the N data packets are calculated based on the time difference between the respective network transmission delays of the N data packets The unit data packet transmission delay increment between the network transmission delays of each data packet.

According to the embodiment of the first aspect of the present disclosure, when it is determined that out-of-order network transmission occurs at the current moment, N is a first value; when it is determined that there is no out-of-order network transmission, N is a second value, and the first value is greater than the second value.

According to an embodiment of the first aspect of the present disclosure, the unit data packet transmission delay increase between the network transmission delays of the N data packets is calculated based on the time difference between the respective network transmission delays of the N data packets The quantity includes: statistics of the expectation of the average ratio of the time difference of the received ACK packets corresponding to the N data packets to the difference in the sending order; update based on the weighted value of the expectation and the unit data packet transmission delay increment at the previous moment The unit packet transmission delay increment at the current moment.

According to an embodiment of the first aspect of the present disclosure, determining the number of data packets to be sent simultaneously based on the congestion degree of the network and the target number of data packets to be sent at the same time includes: determining the number of data packets that have not received the corresponding ACK packet at the current time t Quantity IF (t); Acquire the difference between the number of data packets cwnd (t) and the number IF (t) of the data packets that have not received the corresponding ACK packet at the current moment t, as the first difference; based on the The first difference is used to obtain the number of simultaneous transmissions of the data packets to be transmitted simultaneously.

According to an embodiment of the first aspect of the present disclosure, obtaining the number of data packets to be sent simultaneously based on the first difference includes: determining the number Q(t) of data packets accumulated in the network at the current moment t and the network path Bottleneck queue length Q _max (t)=max(IF(i)), i∈[tk,t], where k represents the length of the predetermined time window; obtain network path bottleneck queue length Q _max (t) and network accumulation The difference between the quantity Q(t) of the data packets is used as the second difference; the smaller value of the first difference and the second difference is used as the number of simultaneous transmissions of the data packets to be sent at the same time .

According to an embodiment of the first aspect of the present disclosure, determining the number of data packets to be sent at the same time according to the degree of congestion of the network and the number of target data packets to be sent at the same time includes: requesting N( The larger one of t) and the simultaneous transmission number s(t) of data packets to be simultaneously sent at the current time t is determined as the final simultaneous transmission number.

According to an embodiment of the second aspect of the present disclosure, a device for sending data packets is provided, including: a transmission delay determining unit configured to determine the minimum network transmission delay within a predetermined time window at the current moment; delay increase The amount determination unit is configured to determine the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time, wherein, N is greater than or equal to 2; the first number determination unit is configured as According to the ratio of the minimum network transmission delay in the predetermined time window at the current moment and the unit data packet transmission delay increment between the N data packets, determine the target number of data packets to be sent at the current moment; the second quantity determining unit , configured to determine the number of data packets to be sent simultaneously according to the congestion degree of the network at the current moment and the target number of data packets to be sent, so as to send the data packets according to the number of data packets to be sent simultaneously.

According to an embodiment of the second aspect of the present disclosure, the transmission delay determining unit is configured to: obtain the receiving time of the ACK packet received within the predetermined time window at the current moment and the sending time of the data packet corresponding to the ACK packet; Calculate the time difference between the receiving time of the ACK packet and the corresponding sending time of the ACK packet, and use the minimum time difference in the calculated time difference as the minimum network transmission delay.

According to an embodiment of the second aspect of the present disclosure, the delay increment determining unit is configured to: determine the N The respective network transmission delays of the N data packets; the unit data packet transmission delay increment between the network transmission delays of the N data packets based on the time difference between the respective network transmission delays of the N data packets .

According to an embodiment of the second aspect of the present disclosure, when the delay increment determining unit determines that the network transmission is out of sequence at the current moment, N is the first value, and when it is determined that the network transmission is not out of sequence, N is the second value, The first value is greater than the second value.

According to an embodiment of the second aspect of the present disclosure, the delay increment determining unit is further configured to: count the expectation of the average ratio of the time difference of the received ACK packets corresponding to the N data packets to the sending order difference; based on the The unit data packet transmission delay increment at the current time is updated by using the weighted value of the above expectation and the unit data packet transmission delay increment at the previous time.

According to an embodiment of the second aspect of the present disclosure, the second quantity determining unit is configured to determine the quantity IF(t) of data packets for which no corresponding ACK packet is received at the current moment t; obtain the target number of data packets sent at the current moment t The difference between cwnd (t) and the number IF (t) of the data packets that have not received the corresponding ACK packet is used as the first difference; based on the first difference, the number of simultaneous transmissions of the data packets to be sent at the same time is obtained .

According to an embodiment of the second aspect of the present disclosure, the second quantity determination unit is configured to: determine the quantity Q(t) of data packets accumulated in the network at the current moment t and the network path bottleneck queue length Q _max (t)=max( IF(i)), i∈[tk,t], where k represents the length of the predetermined time window; obtain the network path bottleneck queue length Q _max (t) and the number of data packets accumulated in the network Q(t) The difference value is used as the second difference value; the smaller value of the first difference value and the second difference value is used as the number of data packets to be sent simultaneously.

According to an embodiment of the second aspect of the present disclosure, the second quantity determination unit is further configured to: use the number requirement N(t) of the paired transmission data packets at the current time t and the simultaneity of the data packets to be simultaneously transmitted at the current time t The larger of the sending numbers s(t) is determined as the final simultaneous sending number.

According to an embodiment of a third aspect of the present disclosure, there is provided an electronic device, comprising: at least one processor; at least one memory storing computer-executable instructions, wherein the computer-executable instructions are processed by the at least one When the processor is running, the at least one processor is prompted to execute the method for sending a data packet according to any one of the embodiments of the first aspect.

According to an embodiment of the fourth aspect of the present disclosure, a non-volatile computer-readable storage medium is provided. When instructions in the non-volatile computer-readable storage medium are executed by a processor of an electronic device, such that The electronic device can execute the method for sending a data packet according to any one of the embodiments of the first aspect.

According to an embodiment of the fifth aspect of the present disclosure, a computer program product is provided, including computer programs/instructions, and when the computer program/instructions are executed by a processor, the transmission described in any one of the embodiments of the first aspect is implemented. Packet method.

According to an embodiment of the sixth aspect of the present disclosure, a computer program is provided, the computer program includes computer program code, and when the computer program code is run on a computer, the computer executes any of the embodiments of the first aspect. A method of sending data packets described herein.

The method and device for sending data packets according to the embodiments of the present disclosure use the data packets sent in pairs at the same time to calculate the transmission time of the data packets, and determine the target transmission according to the minimum end-to-end network delay and the unit data packet transmission time Congestion control window, while considering the degree of congestion in the network to limit the instantaneous sending speed, so that the maximum network throughput can be pursued on the basis of ensuring that the end-to-end transmission delay is close to the base delay, and the network path can be reduced as much as possible. congestion packet loss.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure.

Description of drawings

The accompanying drawings here are incorporated into the specification and constitute a part of the specification, show embodiments consistent with the disclosure, and are used together with the description to explain the principle of the disclosure, and do not constitute an improper limitation of the disclosure.

FIG. 1 is a system environment illustrating a method and an apparatus for transmitting a data packet according to an exemplary embodiment.

FIG. 2 is a flowchart illustrating a method of transmitting a data packet according to an exemplary embodiment.

Fig. 3 is a block diagram showing an apparatus for sending data packets according to an exemplary embodiment.

FIG. 4 is a diagram illustrating a process of transmitting a data packet according to an exemplary embodiment.

FIG. 5 is a schematic diagram illustrating an electronic device transmitting a data packet according to an exemplary embodiment.

FIG. 6 is a schematic diagram illustrating an electronic device transmitting a data packet according to another exemplary embodiment.

Detailed ways

In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.

It should be noted that the terms "first" and "second" in the specification and claims of the present disclosure and the above drawings are used to distinguish similar objects, but not necessarily used to describe a specific sequence or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein can be practiced in sequences other than those illustrated or described herein. The implementations described in the following examples do not represent all implementations consistent with this disclosure. Rather, they are merely examples of apparatuses and methods consistent with aspects of the present disclosure as recited in the appended claims.

What needs to be explained here is that "at least one of several items" appearing in this disclosure all means to include "any one of the several items", "a combination of any of the several items", The three categories of "the whole of the several items" are juxtaposed. For example, "including at least one of A and B" includes the following three parallel situations: (1) including A; (2) including B; (3) including A and B. Another example is "execute at least one of step 1 and step 2", which means the following three parallel situations: (1) execute step 1; (2) execute step 2; (3) execute step 1 and step 2.

FIG. 1 shows a system environment for implementing a method and an apparatus for transmitting a data packet according to an exemplary embodiment of the present disclosure.

As shown in Figure 1, in the ultra-low-latency interactive scenario, data packets are sent out from the sender in sequence, and finally reach the receiver through the transmission network. After receiving the data packets, the receiving end sends corresponding ACK packets in turn, and returns to the sending end after passing through the transmission network. Here, the transmitting end and the receiving end may be any devices serving as nodes in the network, such as mobile terminal devices, base stations, servers, and the like. According to an exemplary embodiment of the present disclosure, a mobile terminal device may be any electronic device with wired and wireless communication capabilities, for example, a mobile phone, a tablet computer, a desktop, a laptop, a handheld computer, a notebook computer, a netbook, a personal digital assistant (personal digital assistant, PDA), augmented reality (augmented reality, AR)/virtual reality (virtual reality, VR) equipment, etc. Transport networks may include, but are not limited to, wired and wireless communication networks.

Since it is an ultra-low-latency business scenario, the entire system has specific requirements for end-to-end data transmission delay. The network bandwidth detection algorithm based on periodic oversending data will introduce unnecessary delay to network transmission, and even lead to congestion, which does not meet the requirements of low-latency transmission. At the same time, periodically emptying the network sending queue to detect the minimum end-to-end transmission delay will greatly reduce the throughput of network transmission. The data packet sending method according to the embodiment of the present disclosure can send data packets in pairs, and count their arrival time difference at the opposite end, and use the ratio of the minimum transmission time of end-to-end transmission to the transmission delay difference of paired data packets as the optimal congestion Control the window, then estimate the bottleneck queue length in the network and the queuing degree of the current network path, and use the bottleneck queue length on the network path to limit the instantaneous sending speed (that is, the queuing degree of the data packet does not exceed the bottleneck queue length of the data packet). Therefore, the data packet sending method and device according to the embodiments of the present disclosure can ensure that the end-to-end transmission delay is close to the base delay, while pursuing the maximum network throughput and avoiding local intermittent congestion of the network as much as possible packet loss.

FIG. 2 is a flowchart illustrating a method of transmitting a data packet according to an exemplary embodiment. The method for sending data packets is applied to various electronic devices to send data packets. As shown in FIG. 2, the method includes the following steps S210 to S240.

Step S210, determining the minimum network transmission delay within the predetermined time window at the current moment.

In the method for sending a data packet according to an embodiment of the present disclosure, for example, a plurality of data packets can be sent at one time through a burst mode (burst), and at least two data packets are sent at the same time each time, thus forming a right packet. Here, the paired data packets may be two adjacent sequential data packets among the multiple data packets sent at the same time, and the sending time of the data packets is recorded in each data packet. Paired data packets will enter the network at the same time and be queued in the network path, and will be sent sequentially in the network according to the order of generation. When receiving the data packet, the receiving end records the sending time of the data packet in the corresponding ACK packet of the data packet and returns it to the sending end. In this way, the time before the data packet was sent can be read from the ACK packet returned by the receiving end, and then the network transmission delay of the data packet can be calculated according to the current time of the sending end and the sending time of the data packet corresponding to the ACK packet.

For example, assuming that the ACK packet of data packet t is returned to the sender, the absolute time T _now of the current sender is counted, and the absolute time st _t when the data packet t was originally sent is analyzed from the ACK packet, and the difference between the arrival time and the sending time rtt _t is calculated =T _now -st _t , so that the minimum delay (also called, base delay) of the transmission path in the predetermined time window (also called, sliding time window) can be updated RTT _min (t)=min(rtt _i ), i∈[tk,t], here, k can represent the length of the sliding time window, usually the value of k can be 1000.

Step S220, determining the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time arriving at the receiving end, where N is greater than or equal to 2.

According to an exemplary embodiment of the present disclosure, determining the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time to the receiving end may include: according to the N data packets returned from the receiving end The sending time recorded in the ACK packet of the data packet and the current moment determine the respective network transmission delays of the N data packets; the N data packets are calculated based on the time difference between the respective network transmission delays of the N data packets The unit packet transmission delay increment between network transmission delays of packets. Here, the unit data packet transmission delay increment reflects the network transmission time consumption of sending a data packet.

Here, if it is determined that out-of-sequence network transmission of data packets occurs at the current moment, more data packets may be used to calculate unit data packet transmission delay increment to ensure accuracy. For example, if it is determined at the current moment that there is no disorder in the network transmission of the data packet, N may be a first number (for example, 2), and if it is determined that disorder occurs, then N is a second number greater than the first number (for example, 6). It should be understood that the numbers here are only examples, and N can take other values (N is greater than or equal to 2 and N in the case of out-of-order is greater than N in the case of no out-of-order). According to an embodiment of the present disclosure, whether out-of-sequence occurs can be determined according to the order of time recorded in the ACK of the data packet received at the previous moment, that is, as shown in the following equation:

Here, N(t) represents the number of data packets sent at the current moment, and rtt _t represents the difference between the arrival time and the sending time of the data packets sent at time t.

According to the embodiment of the present disclosure, the expectation of the average ratio of the time difference and the sending order difference of the ACK packets corresponding to the N data packets sent at the same time can be calculated

Then, the unit data packet transmission delay increment at the current moment is updated Δ(t)=Δ(t-1)*α+δ(t )*(1-α), the value of α can be set as required, for example, the value of α can be 0.875. Through weighting processing, the transmission delay increment can be made smoother. For example, when N=2, the difference between the transmission delays of two data packets can be determined as the unit data packet transmission delay increment, and when N=6, the difference between the transmission delays of 6 data packets can be determined The average value of the 5 transmission delay increments is determined as the unit data packet transmission delay increment.

Step S230, according to the ratio of the minimum network transmission delay within the predetermined time window at the current moment to the unit data packet transmission delay increment among the N data packets, determine the target number of data packets to be sent at the current moment.

Here, the unit data packet transmission delay increment (Delta) reflects the increased data packet round-trip time (RTT) when sending a data packet (that is, the number of data packets staying in the network is increased by one). According to the control strategy of BBR, RTT will fluctuate around a base delay (RTT _prop ). Every time a data packet is sent, the RTT will increase Delta, and the corresponding throughput will also increase. However, when the RTT increases to the base delay RTT _prop , the throughput will no longer increase but the network delay will start to increase. Therefore, the optimal window for sending packets is RTT _prop /Delta.

As described above, according to the embodiments of the present disclosure, the base delay RTT _prop can be approximated by determining the minimum network transmission delay RTT _min (t) within a predetermined time window. Therefore, the target number of data packets to be sent at the current moment can be determined (ie, the optimal window for sending data packets)

In step S240, the number of data packets to be sent at the same time is determined based on the congestion degree of the network at the current moment and the target number of data packets to be sent.

In step S240, the simultaneous sending number of data packets to be sent simultaneously is determined based on the current network congestion level and the target number of data packets to be sent, so as to send data packets according to the simultaneous sending number. That is to say, the higher the congestion degree of the network, the fewer data packets can be sent relative to the target data packets to be sent, and the lower the network congestion degree, the closer the number of data packets to be sent can be closer to the target number of data packets to be sent.

According to an exemplary embodiment of the present disclosure, the upper limit of the number of data packets that can be sent without packet loss can be determined according to the congestion level of the network, and the number of data packets to be sent simultaneously can be determined according to the target number of data packets to be sent and the upper limit value the number of packets.

According to the embodiment of the present disclosure, by processing the packet loss event, the length of the bottleneck queuing queue in the network can be counted in real time (when the value is greater than this value, active packet loss will occur), and the number of data packets sent in real time and the data consumption in the network can be calculated in real time. Speed, to estimate the queuing degree of the current network path. The sending data at any time is subject to the bottleneck queue length of the network, that is, the estimated queuing degree of the current network path at any time is less than or equal to the network bottleneck queue length, so as to ensure that on the basis of no queuing packet loss in the network, the actual average sending window can Infinitely close to the optimal sending window, that is, to pursue the maximum network transmission throughput.

According to an exemplary embodiment of the present disclosure, it may be based on the number Q(t) of accumulated data packets in the network at time t, the number IF(t) of data packets that have not received corresponding ACK packets, and the network path bottleneck queue length Q _max ( t) to reflect the degree of network congestion, and determine the number of data packets that can be sent without packet loss according to Q(t), IF(t) and Q _max (t).

According to an exemplary embodiment of the present disclosure, determining the number of data packets to be sent at the same time based on the congestion degree of the network and the target number of data packets to be sent at the same time may include: determining the number of data packets that have not received the corresponding ACK packet at the current time t IF(t), obtain the difference between the number of data packets cwnd(t) sent by the target at the current moment t and the number of data packets IF(t) that have not received the corresponding ACK packet, as the first difference cwnd(t) -IF(t), and obtain the number of simultaneous transmissions of the data packets to be transmitted simultaneously based on the first difference.

For example, the first difference may be used as the number of data packets sent at the same time, or the first difference may be compared with the number calculated by other methods, and the smaller value thereof may be used as the number of simultaneous transmissions.

According to an exemplary embodiment of the present disclosure, obtaining the number of data packets to be sent simultaneously based on the first difference may include: determining the number Q(t) of data packets accumulated in the network at the current time t and the length of the network path bottleneck queue Q _max (t)=max(IF(i)), i∈[tk,t], where k represents the length of the predetermined time window. Next, the difference _Qmax (t)-Q(t) between the network path bottleneck queue length _Qmax (t) and the number Q(t) of data packets accumulated by the network can be obtained as the second difference, and The smaller value s(t)=min(cwnd(t)-IF(t) of the first difference cwnd(t)-IF(t) and the second difference _Qmax (t)-Q(t), Q _max (t)-Q(t)) is used as the number of simultaneous transmissions of data packets to be transmitted simultaneously.

Here, every time a data packet is sent, the length (quantity) of the data packet accumulation queue in the current network transmission path can be updated Q(t)=Q(t)+1. In addition, the number of data sent but not received in the current network path IF(t)=IF(t)+1 may be updated. Each time an ACK packet is received, the accumulation queue length is updated according to the current time T _now and the receiving time T _last of the last ACK packet

is the unit data packet transmission delay increment described above), and update the number of packets sent but not received IF(t)=IF(t)-1.

That is to say, in the long run, it can be controlled by cwnd and IF(t) so that the average sending rate of data packets is not greater than the network transmission bandwidth, that is, the number of data packets that have not received ACK packets cannot exceed the optimal send window. In the short term, Q _max and Q(t) can be controlled so that the instantaneous sending speed will not cause congestion. That is to say, the speed of increasing the number of data packets that have not received the ACK packet cannot be too fast, otherwise the processing speed of the network nodes cannot keep up, and packet loss will occur. This is because, since each network node has its own local cache, Qmax(t) can be used to indicate the bottleneck cache of the network node, and the consumption speed of data on the network node is 1/Delta, and the data consumption on the network node The accumulation speed is the speed of sending packets, so the accumulation data Q(t) of the node = sent data packets - node consumption speed, it is necessary to ensure that Q(t) cannot exceed Qmax(t) so as not to cause packet loss.

According to an exemplary embodiment of the present disclosure, determining the number of data packets to be sent at the same time according to the degree of congestion of the network and the target number of data packets to be sent includes taking the number requirement N(t) and The larger of the simultaneous sending numbers s(t) of the data packets to be sent simultaneously at the current time t is determined as the final simultaneous sending number. Specifically, the optimal number S _best (t) of data packets to be sent can be determined from the number requirements N(t) and s(t) of the paired data packets to be sent at the current moment t according to the following equation:

Wherein, if it is determined that out-of-sequence occurs in network transmission of data packets at the current moment, N(t) may be a first number (for example, 6), and if no out-of-order occurs, N(t) may be a second number (for example, ,2). Similar to the above, the numbers here are only examples, and N(t) can take other values, as long as the first number is greater than the second number and the second number is greater than 2.

As mentioned above, the method for sending data packets according to the present disclosure utilizes the ratio of network end-to-end delay and unit data packet transmission time as the optimal transmission congestion control window (that is, the target number of data packets to be sent). The number of packets that have not received ACK is equivalent to the bandwidth-delay product (BDP, bandwidth-delay product). The calculation method of the congestion control window is different from the traditional detection method of oversending data and clearing data, and has the following two advantages: 1) It will not introduce additional delay to the network, because the congestion control window is strictly controlled to be less than or equal to the corresponding network bandwidth 2) It will not cause waste of network bandwidth, because the window of network transmission is always maintained near the optimal window, which avoids the transmission interruption caused by periodically clearing the window.

In addition, the data packet sending method according to the embodiment of the present disclosure estimates the queuing degree of the current network path according to the real-time sending quantity of data packets and the data consumption speed in the network, and makes the sending data at any time subject to the maximum queue length of the network , that is, the estimated queuing degree of the current network path at any time is less than or equal to the length of the network bottleneck queue, so as to ensure that the actual average sending window can be infinitely close to the optimal sending window on the basis of no queuing packet loss in the network, that is, the pursuit of the largest network transfer throughput.

The offline comparative experimental data shows that compared with the BBR congestion control algorithm, the data packet sending method of the embodiment of the present disclosure has similar bandwidth throughput, and at the same time, the 95th percentile of end-to-end transmission delay is significantly reduced by 11.16% to 50.29% %, and the overall low-latency viewing experience of users has improved by 2.23%.

FIG. 3 is a block diagram illustrating an apparatus 300 for sending data packets according to the present disclosure. It should be understood that the apparatus 300 may be implemented in various types of electronic devices in the form of hardware/software or a combination of software and hardware.

As shown in FIG. 3 , the device 300 for sending data packets according to the present disclosure may include a transmission delay determining unit 310, a delay increment determining unit 320, a first quantity determining unit 330, a second quantity determining unit 340 and a sending unit 350 .

The transmission delay determining unit 310 is configured to determine the minimum network transmission delay within the predetermined time window at the current moment.

The delay increment determining unit 320 is configured to determine a unit data packet transmission delay increment between network transmission delays of N data packets sent at the same time, where N is greater than or equal to 2.

The first quantity determining unit 330 is configured to determine the target transmission at the current moment according to the ratio of the minimum network transmission delay within the predetermined time window at the current moment to the unit data packet transmission delay increment between the N data packets number of packets.

The second quantity determination unit 340 is configured to determine the simultaneous transmission quantity of the data packets to be transmitted simultaneously according to the congestion degree of the network at the current moment and the target quantity of transmitted data packets.

The sending unit 350 may be configured to send data packets in a burst mode.

According to an embodiment of the present disclosure, N data packets are sent simultaneously in the burst mode, and the sending times of the N data packets are written into the N data packets.

According to an embodiment of the present disclosure, the transmission delay determining unit 310 may be configured to: obtain the receiving time of the ACK packet received within the predetermined time window at the current moment and the sending time of the data packet corresponding to the ACK packet; calculate the ACK The time difference between the receiving time of the packet and the sending time corresponding to the ACK packet, and the minimum time difference in the calculated time difference is used as the minimum network transmission delay.

According to an embodiment of the present disclosure, the delay increment determining unit 320 may be configured to: determine the N data packets according to the sending time recorded in the ACK packet for the N data packets returned from the receiving end and the current time The respective network transmission delays of the packets; the unit data packet transmission delay increment between the network transmission delays of the N data packets is calculated based on the time difference between the respective network transmission delays of the N data packets, wherein , when it is determined that the network transmission is out of order, N is the first value, and when it is currently determined that the network transmission is not out of order, N is the second value, and the first value is greater than the second value. As mentioned above, since the sending time is recorded in the data packets sent at the same time, the sending time can also be recorded in the corresponding returned ACK packet for calculating the network transmission delay of the data packet.

According to an embodiment of the present disclosure, the delay increment determining unit 320 may also be configured to: count the expectation of the average ratio of the time difference of the received ACK packets corresponding to the N data packets to the difference in the sending order; based on the expectation and The weighted value of the unit data packet transmission delay increment at the previous time is used to update the unit data packet transmission delay increment at the current time.

According to an embodiment of the present disclosure, the second quantity determining unit 340 may be configured to determine the quantity IF(t) of data packets that have not received corresponding ACK packets at the current moment t, and obtain the target number of data packets to be sent at the current moment t cwnd( The difference between t) and the number IF(t) of data packets that have not received the corresponding ACK packet is used as the first difference cwnd(t)-IF(t), and based on the first difference, the number of packets to be sent simultaneously is obtained. The number of packets sent at the same time.

According to an exemplary embodiment of the present disclosure, the second quantity determination unit 340 may determine the quantity Q(t) of data packets accumulated in the network at the current moment t and the network path bottleneck queue length Q _max (t)=max(IF(i )), i∈[tk,t], where k represents the length of the predetermined time window. Next, the difference _Qmax (t)-Q(t) between the network path bottleneck queue length _Qmax (t) and the number Q(t) of data packets accumulated by the network can be obtained as the second difference, and The smaller value s(t)=min(cwnd(t)-IF(t) of the first difference cwnd(t)-IF(t) and the second difference _Qmax (t)-Q(t), Q _max (t)-Q(t)) is used as the number of simultaneous transmissions of data packets to be transmitted simultaneously.

According to an embodiment of the present disclosure, the second quantity determining unit 340 is further configured to: use the number requirement N(t) of the paired transmission data packets at the current time t and the simultaneous transmission number s of the data packets to be simultaneously transmitted at the current time t The larger of (t) is determined as the final number of simultaneous transmissions.

Specifically, the final sending data can be determined from the number N(t) of the paired sending data packets at the current time t and the simultaneous sending number s(t) of the data packets to be sent simultaneously at the current time t according to the following equation The number of packages S _best (t):

Wherein, if it is determined at the current moment that the network transmission of the data packet is not out of order, then N(t) is the first value, if it is determined that out of order occurs, then N(t) is the second value, and the second value is greater than the first value .

The operations performed by each unit of the device 300 have been described in detail above with reference to FIG. 2 , and will not be repeated here.

FIG. 4 is a schematic diagram illustrating an overall process of sending a data packet according to an exemplary embodiment of the present disclosure.

As shown in FIG. 4 , the process of sending data packets according to the present disclosure can be generally divided into two parts, that is, the process of calculating the sending window and the process of avoiding congestion.

In the process of calculating the sending window, when the ACK packet of the data packet sent at the same time is received, the arrival time of the corresponding data packet and the sending time difference rtt _t =T _now -st _t can be calculated, so that the transmission path within the predetermined time window can be updated Minimum time delay RTT _min (t)=min(rtt _i ). Similarly, the expectation of the average ratio of the time difference of the ACK packets corresponding to the N data packets sent at the same time to the sending order difference can be counted

Then, the unit data packet transmission delay increment at the current moment is updated Δ(t)=Δ(t-1)*α+δ(t )*(1-α). The optimal sending window cwnd(t) at the current moment is obtained by obtaining the ratio of RTT _min (t) and Δ(t).

In the process of avoiding congestion, it is necessary to calculate the number Q(t) of network accumulated data packets at time t, the number IF(t) of data packets that have not received corresponding ACK packets, and the length of network path bottleneck queue Q _max (t) to reflect The degree of network congestion, and according to Q(t), IF(t) and Q _max (t), determine the number of data packets that can be sent without packet loss. As shown in Figure 4, every time a data packet is sent, the length (quantity) Q(t)=Q(t)+1 of the data packet accumulation queue in the current network transmission path can be updated. The received data amount IF(t)=IF(t)+1. Each time an ACK packet is received, the accumulation queue length is updated according to the current time T _now and the receiving time T _last of the last ACK packet

And update the number of packets sent but not received IF(t)=IF(t)-1. Upon receipt of packet loss, the network path bottleneck queue length Q _max (t) can be determined.

In this way, combined with the previously determined optimal sending window cwnd(t), the expected maximum number of sending data packets _sc =cwnd(t)-IF(t) and The maximum number of data packets that can be sent without packet loss s _q =Q _max (t)-Q(t). The smaller of s _c and s _q s(t)=min(cwnd(t)-IF(t), Q _max (t)-Q(t)) and the number of data packets sent in pairs require N( t) for comparison, and select the larger number max(N(t), s(t)) of the two as the final number S(t) of simultaneously sent data packets.

The process of determining the number of finally sent data packets has been described in detail above with reference to the accompanying drawing 2, and the description will not be repeated here.

FIG. 5 is a schematic diagram illustrating an electronic device 500 for transmitting data packets according to an exemplary embodiment of the present disclosure. The electronic device 500 can be, for example, a smart phone, a tablet computer, an MP4 (Moving Picture Experts Group Audio Layer IV, Moving Picture Experts Group Audio Layer IV) player, a notebook computer or a desktop computer. The electronic device 500 may also be called user equipment, portable terminal, laptop terminal, desktop terminal and other names.

Generally, the electronic device 500 includes: a processor 501 and a memory 502 .

The processor 501 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and the like. Processor 501 can be realized by at least one hardware form in DSP (Digital Signal Processing, digital signal processing), FPGA (Field Programmable Gate Array, field programmable gate array), PLA (Programmable Logic Array, programmable logic array) . Processor 501 may also include a main processor and a coprocessor, and the main processor is a processor for processing data in a wake-up state, also known as a CPU (Central Processing Unit, central processing unit); the coprocessor is Low-power processor for processing data in standby state. In some embodiments, the processor 501 may be integrated with a GPU (Graphics Processing Unit, image processor), and the GPU is used for rendering and drawing the content to be displayed on the display screen. In an exemplary embodiment of the present disclosure, the processor 501 may further include an AI (Artificial Intelligence, artificial intelligence) processor, where the AI processor is configured to process computing operations related to machine learning.

Memory 502 may include one or more computer-readable storage media, which may be non-transitory. The memory 502 may also include high-speed random access memory and non-volatile memory, such as one or more magnetic disk storage devices and flash memory storage devices. In some embodiments, the non-transitory computer-readable storage medium in the memory 502 is used to store at least one instruction, and the at least one instruction is used to be executed by the processor 501 to implement the sending data of the exemplary embodiments of the present disclosure. method of the package.

In some embodiments, the electronic device 500 may optionally further include: a peripheral device interface 503 and at least one peripheral device. The processor 501, the memory 502, and the peripheral device interface 503 may be connected through buses or signal lines. Each peripheral device can be connected to the peripheral device interface 503 through a bus, a signal line or a circuit board. Specifically, the peripheral device includes: at least one of a radio frequency circuit 504 , a touch screen 505 , a camera 506 , an audio circuit 507 , a positioning component 508 and a power supply 509 .

The peripheral device interface 503 may be used to connect at least one peripheral device related to I/O (Input/Output, input/output) to the processor 501 and the memory 502 . In some embodiments, the processor 501, memory 502 and peripheral device interface 503 are integrated on the same chip or circuit board; in some other embodiments, any one of the processor 501, memory 502 and peripheral device interface 503 or The two can be implemented on a separate chip or circuit board, which is not limited in this embodiment.

The radio frequency circuit 504 is used to receive and transmit RF (Radio Frequency, radio frequency) signals, also called electromagnetic signals. The radio frequency circuit 504 communicates with the communication network and other communication devices through electromagnetic signals. The radio frequency circuit 504 converts electrical signals into electromagnetic signals for transmission, or converts received electromagnetic signals into electrical signals. In some embodiments, the radio frequency circuit 504 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and the like. The radio frequency circuit 504 can communicate with other terminals through at least one wireless communication protocol. The wireless communication protocol includes but is not limited to: metropolitan area network, mobile communication networks of various generations (2G, 3G, 4G and 5G), wireless local area network and/or WiFi (Wireless Fidelity, wireless fidelity) network. In some embodiments, the radio frequency circuit 504 may also include circuits related to NFC (Near Field Communication, short-range wireless communication), which is not limited in the present disclosure.

The display screen 505 is used to display a UI (User Interface, user interface). The UI can include graphics, text, icons, video, and any combination thereof. When the display screen 505 is a touch display screen, the display screen 505 also has the ability to collect touch signals on or above the surface of the display screen 505 . The touch signal can be input to the processor 501 as a control signal for processing. At this time, the display screen 505 can also be used to provide virtual buttons and/or virtual keyboards, also called soft buttons and/or soft keyboards. In some embodiments, there may be one display screen 505 , which is set on the front panel of the electronic device 500 . In other embodiments, there may be at least two display screens 505, which are respectively arranged on different surfaces of the terminal 500 or in a folding design. In still other embodiments, the display screen 505 may be a flexible display screen, which is arranged on the curved surface or the folded surface of the terminal 500 . Even, the display screen 505 can also be set as a non-rectangular irregular figure, that is, a special-shaped screen. The display screen 505 can be made of LCD (Liquid Crystal Display, liquid crystal display), OLED (Organic Light-Emitting Diode, organic light-emitting diode) and other materials.

The camera assembly 506 is used to capture images or videos. In some embodiments, the camera assembly 506 includes a front camera and a rear camera. Usually, the front camera is set on the front panel of the terminal, and the rear camera is set on the back of the terminal. In some embodiments, there are at least two rear cameras, which are any one of the main camera, depth-of-field camera, wide-angle camera, and telephoto camera, so as to realize the fusion of the main camera and the depth-of-field camera to realize the background blur function. Combined with the wide-angle camera to achieve panoramic shooting and VR (Virtual Reality, virtual reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 506 may also include a flash. The flash can be a single-color temperature flash or a dual-color temperature flash. Dual color temperature flash refers to the combination of warm light flash and cold light flash, which can be used for light compensation under different color temperatures.

Audio circuitry 507 may include a microphone and speakers. The microphone is used to collect sound waves of the user and the environment, and convert the sound waves into electrical signals and input them to the processor 501 for processing, or input them to the radio frequency circuit 504 to realize voice communication. For the purpose of stereo sound collection or noise reduction, there may be multiple microphones, which are respectively arranged at different parts of the terminal 500 . The microphone can also be an array microphone or an omnidirectional collection microphone. The speaker is used to convert the electrical signal from the processor 501 or the radio frequency circuit 504 into sound waves. The loudspeaker can be a conventional membrane loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, it is possible not only to convert electrical signals into sound waves audible to humans, but also to convert electrical signals into sound waves inaudible to humans for purposes such as distance measurement. In some embodiments, the audio circuit 507 may also include a headphone jack.

The positioning component 508 is used to locate the current geographic location of the electronic device 500, so as to realize navigation or LBS (Location Based Service, location-based service). The positioning component 508 may be a positioning component based on the GPS (Global Positioning System, Global Positioning System) of the United States, the Beidou system of China, the Greinus system of Russia or the Galileo system of the European Union.

The power supply 509 is used to supply power to various components in the electronic device 500 . Power source 509 may be AC, DC, disposable or rechargeable batteries. When the power source 509 includes a rechargeable battery, the rechargeable battery may support wired charging or wireless charging. The rechargeable battery can also be used to support fast charging technology.

In some embodiments, the electronic device 500 further includes one or more sensors 510 . The one or more sensors 510 include, but are not limited to: an acceleration sensor 511 , a gyro sensor 512 , a pressure sensor 513 , a fingerprint sensor 514 , an optical sensor 515 and a proximity sensor 516 .

The acceleration sensor 511 can detect the acceleration on the three coordinate axes of the coordinate system established by the terminal 500 . For example, the acceleration sensor 511 can be used to detect the components of the acceleration of gravity on the three coordinate axes. The processor 501 may control the touch display screen 505 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 511 . The acceleration sensor 511 can also be used for collecting game or user's motion data.

The gyro sensor 512 can detect the body direction and rotation angle of the terminal 500 , and the gyro sensor 512 can cooperate with the acceleration sensor 511 to collect 3D actions of the user on the terminal 500 . According to the data collected by the gyroscope sensor 512, the processor 501 can realize the following functions: motion sensing (such as changing the UI according to the user's tilt operation), image stabilization during shooting, game control and inertial navigation.

The pressure sensor 513 may be disposed on a side frame of the terminal 500 and/or a lower layer of the touch screen 505 . When the pressure sensor 513 is set on the side frame of the terminal 500 , it can detect the user's grip signal on the terminal 500 , and the processor 501 performs left and right hand recognition or shortcut operation according to the grip signal collected by the pressure sensor 513 . When the pressure sensor 513 is arranged on the lower layer of the touch screen 505, the processor 501 controls the operable controls on the UI according to the user's pressure operation on the touch screen 505. The operable controls include at least one of button controls, scroll bar controls, icon controls, and menu controls.

The fingerprint sensor 514 is used to collect the user's fingerprint, and the processor 501 recognizes the identity of the user according to the fingerprint collected by the fingerprint sensor 514, or the fingerprint sensor 514 recognizes the user's identity according to the collected fingerprint. When the identity of the user is recognized as a trusted identity, the processor 501 authorizes the user to perform relevant sensitive operations, such sensitive operations include unlocking the screen, viewing encrypted information, downloading software, making payment, and changing settings. The fingerprint sensor 514 may be disposed on the front, back or side of the electronic device 500 . When the electronic device 500 is provided with a physical button or a manufacturer's Logo, the fingerprint sensor 514 may be integrated with the physical button or the manufacturer's Logo.

The optical sensor 515 is used to collect ambient light intensity. In one embodiment, the processor 501 can control the display brightness of the touch screen 505 according to the ambient light intensity collected by the optical sensor 515 . Specifically, when the ambient light intensity is high, the display brightness of the touch screen 505 is increased; when the ambient light intensity is low, the display brightness of the touch screen 505 is decreased. In another embodiment, the processor 501 may also dynamically adjust shooting parameters of the camera assembly 506 according to the ambient light intensity collected by the optical sensor 515 .

The proximity sensor 516 , also called a distance sensor, is usually arranged on the front panel of the electronic device 500 . The proximity sensor 516 is used to collect the distance between the user and the front of the electronic device 500 . In one embodiment, when the proximity sensor 516 detects that the distance between the user and the front of the terminal 500 gradually decreases, the processor 501 controls the touch display 505 to switch from the bright screen state to the off screen state; when the proximity sensor 516 detects When the distance between the user and the front of the electronic device 500 gradually increases, the processor 501 controls the touch display screen 505 to switch from the off-screen state to the on-screen state.

Those skilled in the art can understand that the structure shown in FIG. 5 does not constitute a limitation to the electronic device 500, and may include more or less components than shown in the figure, or combine some components, or adopt different component arrangements.

FIG. 6 shows a structural block diagram of another electronic device 600 . For example, the electronic device 600 may be provided as a server. Referring to FIG. 6 , an electronic device 600 includes one or more processing processors 610 and a memory 620 . The memory 620 may include one or more programs for performing the above sending data packets. The electronic device 600 may also include a power supply component 630 configured to perform power management of the electronic device 600, a wired or wireless network interface 650 configured to connect the electronic device 600 to a network, and an input-output (I/O) interface 650 . The electronic device 600 can operate based on an operating system stored in the memory 620, such as Windows Server™, Mac OS X™, Unix™, Linux™, FreeBSD™ or the like.

Those skilled in the art can understand that the structure shown in FIG. 6 does not constitute a limitation to the electronic device 600, and may include more or less components than shown in the figure, or combine some components, or adopt a different arrangement of components.

According to an embodiment of the present disclosure, there is also provided a computer-readable storage medium storing instructions, wherein, when the instructions are executed by at least one processor, at least one processor is prompted to execute the method described in any one of the embodiments of the present disclosure. Method for sending packets.

The computer readable storage medium may be a non-transitory computer readable storage medium. Examples of computer readable storage media herein include: Read Only Memory (ROM), Random Access Programmable Read Only Memory (PROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Random Access Memory (RAM) , Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), Flash Memory, Non-Volatile Memory, CD-ROM, CD-R, CD+R, CD-RW, CD+RW, DVD-ROM , DVD-R, DVD+R, DVD-RW, DVD+RW, DVD-RAM, BD-ROM, BD-R, BD-R LTH, BD-RE, Blu-ray or Optical Memory, Hard Disk Drive (HDD), Solid State Hard disks (SSD), memory cards (such as MultiMediaCards, Secure Digital (SD) or Extreme Digital (XD) cards), magnetic tapes, floppy disks, magneto-optical data storage devices, optical data storage devices, hard disks, solid-state disks, and any other means configured to store a computer program and any associated data, data files and data structures in a non-transitory manner and to provide said computer program and any associated data, data files and data structures to the processor or the computer to enable the processor or the computer to execute the computer program. The computer program in the above-mentioned computer-readable storage medium can run in an environment deployed in computer equipment such as a client, a host, an agent device, a server, etc. In addition, in one example, the computer program and any associated data and data files and data structures are distributed over network-connected computer systems so that the computer programs and any associated data, data files and data structures are stored, accessed and executed in a distributed fashion by one or more processors or computers.

According to an embodiment of the present disclosure, a computer program product is also provided, and instructions in the computer program product can be executed by a processor of a computer device to complete the method for sending a data packet described in any one of the embodiments of the present disclosure.

According to an embodiment of the present disclosure, there is also provided a computer program, the computer program including computer program code, when the computer program code is run on a computer, so that the computer executes the method described in any one of the embodiments of the present disclosure. Method for sending packets.

The method, device, electronic device, computer-readable storage medium, computer program product, and computer program according to the embodiments of the present disclosure can enable the pursuit of Maximize network throughput and minimize packet loss due to congestion in the network path.

Other embodiments of the present disclosure will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. The present disclosure is intended to cover any modification, use or adaptation of the present disclosure. These modifications, uses or adaptations follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not disclosed in the present disclosure. . The specification and examples are to be considered exemplary only, with the true scope of the disclosure being indicated by the following claims.

It should be understood that the present disclosure is not limited to the precise constructions which have been described above and shown in the drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

All the embodiments of the present disclosure can be implemented independently or in combination with other embodiments, which are all regarded as the scope of protection required by the present disclosure.

Claims (20)

1. A method for sending data packets, comprising:

   Determine the minimum network transmission delay within the predetermined time window at the current moment;

   Determine the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time, where N is greater than or equal to 2;

   According to the ratio of the minimum network transmission delay within the predetermined time window at the current moment and the unit data packet transmission delay increment between the N data packets, determine the target number of data packets to be sent at the current moment;

   The simultaneous transmission quantity of data packets to be simultaneously transmitted is determined based on the congestion degree of the network at the current moment and the target transmission quantity of data packets, so as to transmit the data packets according to the simultaneous transmission quantity.
2. The method according to claim 1, wherein determining the minimum network transmission delay within the predetermined time window at the current moment comprises:

   Obtain the receiving time of the ACK packet received in the predetermined time window at the current moment and the sending time of the data packet corresponding to the ACK packet;

   Calculate the time difference between the receiving time of the ACK packet and the corresponding sending time of the ACK packet, and use the minimum time difference in the calculated time difference as the minimum network transmission delay.
3. The method according to claim 1 or 2, wherein determining the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time arriving at the receiving end comprises:

   Determine the respective network transmission delays of the N data packets according to the sending time recorded in the ACK packets for the N data packets returned from the receiving end and the current moment;

   The unit data packet transmission delay increment between the network transmission delays of the N data packets is calculated based on the time difference between the respective network transmission delays of the N data packets.
4. The method according to any one of claims 1 to 3, wherein when it is determined that the network transmission is out of order at the current moment, N is the first value, and when it is determined that the network transmission is not out of order, N is the second value Values, the first value is greater than the second value.
5. The method according to claim 3, wherein the unit data packet transmission delay between the network transmission delays of the N data packets is calculated based on the time difference between the respective network transmission delays of the N data packets Time increments include:

   Statistically receive the expectation of the average ratio of the time difference of the ACK packets corresponding to the N data packets and the sending sequence difference;

   The unit data packet transmission delay increment at the current time is updated based on the weighted value of the expected and the unit data packet transmission delay increment at the previous time.
6. The method according to any one of claims 1 to 5, characterized in that, determining the simultaneous sending number of data packets to be sent simultaneously based on the degree of congestion of the network and the number of target sending data packets includes:

   Determine the number IF(t) of data packets that have not received the corresponding ACK packet at the current moment t;

   Obtain the difference between the number of data packets IF (t) of the target sending data packet quantity cwnd (t) of current moment t and the data packet that has not received corresponding ACK packet, as the first difference;

   The simultaneous sending quantity of the data packets to be sent simultaneously is obtained based on the first difference.
7. The method according to claim 6, wherein obtaining the number of simultaneous transmissions of data packets to be simultaneously transmitted based on the first difference comprises:

   Determine the quantity Q(t) of data packets accumulated in the network at the current moment t and the network path bottleneck queue length Q _max (t)=max(IF(i)), i∈[tk,t], where k represents the predetermined the length of the time window;

   Obtain the difference between the network path bottleneck queue length Q _max (t) and the quantity Q (t) of the data packets accumulated by the network, as the second difference;

   The smaller value of the first difference value and the second difference value is used as the number of data packets to be sent simultaneously.
8. The method according to any one of claims 1 to 7, characterized in that, determining the number of simultaneous transmissions of data packets to be sent simultaneously according to the degree of congestion of the network and the number of target data packets to be sent comprises:

   The larger one of the number of data packets to be sent in pairs at the current time t N(t) and the number of simultaneous transmissions s(t) of data packets to be sent simultaneously at the current time t is determined as the final number of simultaneous transmissions.
9. A device for sending data packets, characterized in that it comprises:

   A transmission delay determination unit configured to determine the minimum network transmission delay within a predetermined time window at the current moment;

   The delay increment determination unit is configured to determine the unit data packet transmission delay increment between the network transmission delays of the N data packets sent at the same time, where N is greater than or equal to 2;

   The first quantity determining unit is configured to determine the target transmission at the current moment according to the ratio of the minimum network transmission delay within the predetermined time window at the current moment to the unit data packet transmission delay increment between the N data packets number of packets;

   The second quantity determination unit is configured to determine the simultaneous transmission quantity of the data packets to be sent simultaneously according to the congestion degree of the network at the current moment and the target transmission quantity of data packets, so as to transmit the data packets according to the simultaneous transmission quantity.
10. The device according to claim 9, wherein the transmission delay determining unit is configured to:

    Obtain the receiving time of the ACK packet received in the predetermined time window at the current moment and the sending time of the data packet corresponding to the ACK packet;

    Calculate the time difference between the receiving time of the ACK packet and the corresponding sending time of the ACK packet, and use the minimum time difference in the calculated time difference as the minimum network transmission delay.
11. The device according to claim 9 or 10, wherein the delay increment determining unit is configured to:

    Determine the respective network transmission delays of the N data packets according to the sending time recorded in the ACK packets for the N data packets returned from the receiving end and the current moment;

    The unit data packet transmission delay increment between the network transmission delays of the N data packets is calculated based on the time difference between the respective network transmission delays of the N data packets.
12. The device according to any one of claims 9 to 11, wherein when the delay increment determining unit determines that the network transmission is out of order at the current moment, N is the first value, and when it is determined that the network transmission is not out of order , N is the second value, and the first value is greater than the second value.
13. The device according to claim 11, wherein the delay increment determining unit is further configured to:

    Statistically receive the expectation of the average ratio of the time difference of the ACK packets corresponding to the N data packets and the sending sequence difference;

    The unit data packet transmission delay increment at the current time is updated based on the weighted value of the expected and the unit data packet transmission delay increment at the previous time.
14. The device according to any one of claims 9 to 13, wherein the second quantity determination unit is configured to:

    Determine the number IF(t) of data packets that have not received the corresponding ACK packet at the current moment t;

    Obtain the difference between the number of data packets cwnd (t) of the target sending data packets at the current moment t and the number of data packets IF (t) that have not received the corresponding ACK packet, as the first difference;

    The simultaneous sending quantity of the data packets to be sent simultaneously is obtained based on the first difference.
15. The device according to claim 14, wherein the second quantity determination unit is configured to:

    Determine the quantity Q(t) of data packets accumulated in the network at the current moment t and the network path bottleneck queue length Q _max (t)=max(IF(i)), i∈[tk,t], where k represents the predetermined the length of the time window;

    Obtain the difference between the network path bottleneck queue length Q _max (t) and the quantity Q (t) of the data packets accumulated by the network, as the second difference;

    The smaller value of the first difference value and the second difference value is used as the number of data packets to be sent simultaneously.
16. The device according to any one of claims 9 to 15, wherein the second quantity determining unit is further configured to:

    The larger one of the number of data packets to be sent in pairs at the current time t N(t) and the number of simultaneous transmissions s(t) of data packets to be sent simultaneously at the current time t is determined as the final number of simultaneous transmissions.
17. An electronic device, characterized in that it comprises:

    at least one processor;

    at least one memory storing computer-executable instructions,

    Wherein, the computer-executable instructions, when executed by the at least one processor, cause the at least one processor to perform the method according to any one of claims 1-8.
18. A non-volatile computer-readable storage medium, when the instructions in the non-volatile computer-readable storage medium are executed by the processor of the electronic device, the electronic device can perform any one of claims 1 to 8 method described in the item.
19. A computer program product, comprising computer programs/instructions, wherein the computer program/instructions implement the method according to any one of claims 1 to 8 when executed by a processor.
20. A computer program, characterized in that the computer program includes computer program code, and when the computer program code is run on a computer, the computer executes the method according to any one of claims 1 to 8.

Images