A packet transmission method and system based on stream coding and bandwidth estimation drive
By adopting stream coding and bandwidth estimation-driven packet transmission methods in Changfa wireless links, the low bandwidth utilization and high latency problems caused by traditional TCP protocol are solved, and more efficient data transmission and smooth throughput are achieved.
Patent Information
- Application Number
- CN202210306577.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-03-25
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2042-03-25
AI Technical Summary
In the long-term wireless link, the low bandwidth utilization and high-end-to-end orderly delivery delay caused by traditional TCP protocols, and the existing TCP congestion control protocol variants fail to effectively solve the performance bottleneck caused by slow startup and random link errors. .
Using packet transmission method based on stream encoding and bandwidth estimation drive, packet loss rate estimation is used to repair packets through predictive transmission, replace traditional congestion control algorithms, dynamically adjust packet transmission intervals and select packet types, and realize packet loss recovery without transmission layer retransmission and congestion control.
It significantly reduces the high-end to-end orderly delivery delay caused by retransmission in long-term delay links, improves the effective throughput of the link, and is suitable for streaming and interactive applications.
Smart Images

Figure CN114666831B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of wireless communications, and in particular relates to a packet transmission method and system based on stream coding and bandwidth estimation driving. Background Art
[0002] Wireless links with large bandwidth-delay products, i.e., fat links, are expected to be widely present in the next generation of mobile communication technologies. How to efficiently transmit packets in lossy, large-bandwidth, and long-delay links will be a new challenge. Currently, most applications rely on the traditional control protocol (TCP) for data transmission, of which the congestion control algorithm (CCA) and the retransmission-based lost packet recovery process are two important components. Although TCP currently performs well in terrestrial networks, it often exhibits low bandwidth utilization in fat wireless links. This is because TCP, including most of its variants, regards packet loss as a signal of network congestion and reduces the transmission rate when the network is congested. However, packet loss in wireless links may also be caused by random link errors rather than congestion. On the other hand, in fat links, due to the high round trip time (RTT) characteristics of the link, slow start and congestion window growth may be quite slow. Therefore, it may take a long time for the network connection to fully utilize the bandwidth. Especially in short-term data volume connections, the link bandwidth utilization will be seriously reduced.
[0003] In addition to low bandwidth utilization, end-to-end in-order delivery delay is also a significant issue. End-to-end in-order delivery delay is the time interval between when a packet is first sent and when it is sent in order to the receiving application layer. When a lost packet is retransmitted, the remaining packets with sequence numbers greater than the lost packet must wait in the buffer until recovery is complete. Therefore, the delivery delay of each lost packet will be at least 1.5 RTT, which may affect the user experience in long-latency links.
[0004] Optimizing TCP's classic "slow start" and "aggregate increase / multiplicative decrease" (AIMD) mechanisms for high packet loss and large bandwidth-delay products has always been an important research direction. Previously, many TCP congestion control protocol variants have been proposed in the field to solve these problems, including TCP Hybla, TCP Westwood, TCP-Jersey, TCP Cubic, and Google's BBR. TCP Hybla is mainly aimed at improving long-delay links. Its basic idea is to set the window length so that the transmission rate can reach the same level as Reno in a certain small target RTT scenario, but it does not take into account random link losses. TCP Westwood and TCP-Jersey set the congestion threshold based on ACK to estimate the available bandwidth to quickly recover from the decline in CWND. TCP Cubic selects the congestion window length based on the cubic function of the actual time from the previous congestion event (rather than the RTT value) to overcome the shortcomings of "slow start" and AIMD being too slow. However, these variants focus mainly on the congestion avoidance phase rather than the slow start phase. Google's BBR uses the bandwidth-delay product based on the estimated link to control the congestion window. Ideally, it can fully utilize the bandwidth without causing queuing delays. However, since BBR requires multiple rounds to obtain the actual bandwidth, it will have the same problem as TCP in the slow start phase. Secondly, the stability of BBR estimation is insufficient in long-delay links. Since the pacing gain in the BBR startup phase is 2 / ln2 and the congestion window gain is constant at 2, a large number of packets may burst into the link. The problem is further exacerbated when multiple BBR flows compete with each other. Therefore, it is still not enough to meet the needs of long fat links.
[0005] When faced with fat links, existing transport layer protocols mainly face two problems: low bandwidth utilization caused by congestion control algorithms based on packet loss signals and high-end end-to-end ordered delivery delays caused by packet retransmission recovery. Summary of the invention
[0006] The present invention adopts a packet transmission method and system based on stream coding and bandwidth estimation drive. On the one hand, it relies on active stream coding based on packet loss rate estimation to "predictively" send repair packets to recover lost packets in advance, solving the problem of high-end end-to-end orderly delivery delay caused by packet retransmission recovery. On the other hand, it uses a congestion control algorithm based on bandwidth estimation to replace the congestion control algorithm based on packet loss signal to solve the problem of low bandwidth utilization.
[0007] The technical solution adopted by the present invention is: a packet transmission method based on stream coding and bandwidth estimation drive, comprising the following steps:
[0008] S1, the connection between the sender and the receiver is initialized, and then the receiver sends a file request;
[0009] S2, the sending end receives the file request, opens the file to obtain the content and initializes the transmission parameters, and then packs the MetaInfo group and sends it to the receiving end; the MetaInfo group includes the requested file name, the requested file size, the sending port, the number of source packets to be sent, and the stream coding parameters; the stream coding parameters include the Galois field, the transmission packet size, the frequency of sending the repair packet, and the random coding coefficient seed;
[0010] S3, the receiving end accepts MetaInfo and feedbacks that MetaInfo has been accepted; MetaInfo is used to initialize stream encoding parameters; the receiving end stream codec is initialized and waits for the arrival of new packets;
[0011] S4, the transmitting end processes the feedback information of the receiving end, estimates the available bandwidth and the smoothed round-trip time RTT; updates the link congestion window and performs congestion control according to the link available bandwidth and the smoothed round-trip time RTT; estimates the link packet loss rate based on the feedback information of the receiving end;
[0012] S5: The sender determines whether there is any congestion window remaining. If there is no congestion window remaining, S5 is repeated.
[0013] S6. The transmitting end selects the type of packet to be sent based on the current link packet loss rate and implements the sending action; the type of packet includes an uncoded source packet and a coded repair packet;
[0014] S7, the receiving end decodes and recovers the received packets, and transmits them to the upper layer in order; if packet loss occurs, the received repair packets are used to recover the data without notifying the sending end to retransmit; after receiving, feedback information is sent to the sending end; the feedback information includes the ID of the ACK packet, the orderly identification of the receiving end, the number of received source packets, the number of received repair packets and the latest received packet information; the latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type and the number of packets that do nothing;
[0015] S8. Repeat S4 to S7 until the packet transmission is completed.
[0016] As a preferred technical solution of the present invention: the updating of the link congestion window and performing congestion control according to the link available bandwidth and the smoothed round trip time RTT in S4 specifically includes the following steps:
[0017] S4-1. Use each ACK to estimate the link bandwidth. Let t n is the arrival time of the nth ACK, Xn is the number of newly received ACK packets since the previous ACK;
[0018] S4-2. When the second ACK is received, the estimation begins and the first estimation is recorded as:
[0019]
[0020] For the subsequent ACK (n>=3),
[0021]
[0022] Among them, sRTT is the smoothed RTT during estimation; the smoothed RTT is obtained by filtering the instantaneous RTT, which is estimated based on the arrival time of the ACK and the sending time of the received ACK packet record, that is:
[0023] iRTT=t acked -t sent
[0024] The iRTT in the formula is the instantaneous RTT;
[0025] S4-3. The smoothed RTT after receiving the nth ACK is calculated as:
[0026] sRTT n =α*sRTT n-1 +(1-α)*iRTT
[0027] In addition to sRTT n In addition, SC-UDP also tracks the minimum iRTT in the past 10 seconds, denoted as RTTmin;
[0028] S4-4. Calculate the congestion window size of the sender when receiving each ACK:
[0029] CWND n =BW n *RTTmin
[0030] When the bandwidth BW2 is large, it may cause a sharp increase in the instantaneous congestion window and burst traffic to be injected into the network, resulting in buffer overflow loss.
[0031] As a preferred technical solution of the present invention: S6 comprises the following steps:
[0032] S6-1, let i seq Indicates the number of the most recently sent uncoded source packet, initialize i seq = -1, every time a source packet is sent, i seq Add 1; the repair group is expressed as:
[0033]
[0034] The repair packet is a linear combination of the source packets that have been sent, where c k is the repair group numbered k; g k,i From a finite field The stream coding coefficients randomly extracted from , k = 0, 1, 2, 3, ... are the numbers of the repair packets; w s The number corresponding to the earliest source packet in the current sending queue;
[0035] S6-2, Initialize w s = 0, according to the feedback from the receiving end, the original packet that has been confirmed to be received will be removed from the queue. At this time, w s Will be updated; let w e =i seq ,[w s , w e ] is called the coding window of the current repair group;
[0036] S6-3, the sender selects the type of packet to be sent based on the packet loss rate of the current link and implements the sending action; when the current repair insertion frequency is lower than When, that is:
[0037]
[0038] Send repair packets, otherwise send source packets; and are the current time t c the number of source packets and repair packets sent by the sender, The calculation formula for smoothing the packet loss rate is similar to that for smoothing RTT, δ∈(0,1).
[0039] As a preferred technical solution of the present invention: S7 comprises the following steps:
[0040] S7-1, let i ord Indicates the latest ordered transmission group number, initialize i ord =-1, the initial state of the decoder is an ordered state;
[0041] S7-2, when the next packet received by the decoder is neither S iord+1 Nor is it w e =i ord If a repair packet with the characteristics of i is found, the ordered transmission is interrupted; the decoder enters the out-of-order state, at which time the decoder will buffer the received packets and try to decode them; the buffered packets are out-of-order source packets, and their numbers are greater than i ord +1 or fix grouping where we >i ord +1;
[0042] S7-3, Order And order The maximum number of the upper bound of the coding window in the buffered repair group; is called the decoder's current decoding window; as the number of buffered packets increases, the window may expand, i.e. Growth; The decoder uses Gaussian elimination to decode, that is, dynamically constructs a linear equation system AS=B and performs forward elimination online, where the rows of A and B are the coding coefficients and coded information symbols of the buffered packets, respectively, and the disordered source packets are regarded as special repair packets with only one non-zero element 1 in the coding coefficients;
[0043] S7-4, when the decoding is successful, all the decoded source packets in the decoding window are transmitted to the upper layer application, and the decoder is restored to the ordered state, and the ordered transmission is completed. Restart; after receiving is completed, send feedback information to the sending end.
[0044] A packet transmission system based on a packet transmission method driven by stream coding and bandwidth estimation, comprising a transmitting end, a receiving end, a state estimation unit, a stream coding transmission unit, a congestion and FEC control unit and other auxiliary units;
[0045] The transmitting end is used to send a packet, wherein the packet is an uncoded source packet or a coded repair packet;
[0046] The receiving end is provided with a decoder for decoding the received packets and transmitting them to the upper layer application in an orderly manner. At the same time, the receiving end also sends feedback information to the sending end. The feedback information includes the ID of the ACK packet, the orderly identification of the receiving end, the number of received source packets, the number of received repair packets and the latest received packet information. The latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type, and the number of actions of doing nothing;
[0047] The state estimation unit includes bandwidth estimation, round-trip time estimation, and packet loss rate estimation, providing link space perception capability for the packet transmission system;
[0048] The stream coding transmission unit provides encoding and decoding functions of stream coding transmission; the stream coding transmission unit adopts a packet-level active forward error correction code based on packet loss rate, namely, stream coding, and predictively sends repair packets based on the estimation of link packet loss rate to replace the retransmission caused by packet loss in traditional congestion control;
[0049] The congestion control and FEC unit provides congestion control capability in packet transmission and the ability to adaptively adjust the FEC code rate;
[0050] Other auxiliary units are used to ensure the reliability and integrity of the packet transmission protocol; the auxiliary units mainly include functions such as initial information exchange, data transmission end, timeout timing, etc.
[0051] Compared with the prior art, the present invention has the following beneficial effects:
[0052] (1) The present invention adopts stream coding to realize lost packet recovery and proposes a packet loss recovery scheme without transport layer retransmission, which provides a reliability mechanism for UDP transmission and significantly reduces the high-end end-to-end ordered delivery delay caused by retransmission in long-latency links, achieving a smoother effective throughput, which is very beneficial for streaming media and interactive applications.
[0053] (2) The present invention also adopts a congestion control method based on bandwidth estimation. By processing the feedback information from the receiving end, the current bandwidth, round-trip delay and packet loss rate of the link are estimated, the packet sending interval is dynamically adjusted, and the type of packet to be sent is automatically selected, thereby solving the problem of frequent decrease of the congestion window caused by random packet loss and improving the effective throughput of the link. BRIEF DESCRIPTION OF THE DRAWINGS
[0054] Figure 1 is a flow chart of the method of the present invention;
[0055] Figure 2 It is a system schematic diagram of the present invention. DETAILED DESCRIPTION
[0056] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. Of course, the specific embodiments described here are only used to explain the present invention and are not used to limit the present invention.
[0057] like Figure 1 As shown, the packet transmission method based on stream coding and bandwidth estimation drive proposed by the present invention is based on the UDP transmission protocol, referred to as SC-UDP. The present invention automatically selects whether to send repair packets or source packets by adjusting the stream coding bit rate based on the estimation of the link packet loss rate. When packet loss occurs, the receiving end can use the repair packet to complete data recovery, solving the problem of high-end to end orderly delivery delay caused by packet retransmission recovery. Since there is no packet loss signal in the link at this time, the present invention also performs congestion control to solve the problem of low transmission bandwidth utilization.
[0058] The present invention comprises the following steps:
[0059] S1, the connection between the sender and the receiver is initialized, and then the receiver sends a file request;
[0060] S2, the sending end receives the file request, opens the file to obtain the content and initializes the transmission parameters, and then packs the MetaInfo group and sends it to the receiving end; the MetaInfo group includes the requested file name, the requested file size, the sending port, the number of source packets to be sent, and the stream coding parameters; the stream coding parameters include the Galois field, the transmission packet size, the frequency of sending the repair packet, and the random coding coefficient seed;
[0061] S3, the receiving end accepts MetaInfo and feedbacks that MetaInfo has been accepted; MetaInfo is used to initialize stream encoding parameters; the receiving end stream codec is initialized and waits for the arrival of new packets;
[0062] S4, the transmitting end processes the feedback information of the receiving end, estimates the available bandwidth and the smoothed round-trip time RTT; updates the link congestion window and performs congestion control according to the link available bandwidth and the smoothed round-trip time RTT; estimates the link packet loss rate based on the feedback information of the receiving end;
[0063] S5: The sender determines whether there is any congestion window remaining. If there is no congestion window remaining, S5 is repeated.
[0064] S6. The transmitting end selects the type of packet to be sent based on the current link packet loss rate and implements the sending action; the type of packet includes an uncoded source packet and a coded repair packet;
[0065] S7, the receiving end decodes and recovers the received packets, and transmits them to the upper layer in order; if packet loss occurs, the received repair packets are used to recover the data without notifying the sending end to retransmit; after receiving, feedback information is sent to the sending end; the feedback information includes the ID of the ACK packet, the orderly identification of the receiving end, the number of received source packets, the number of received repair packets and the latest received packet information; the latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type and the number of packets that do nothing;
[0066] S8. Repeat S4 to S7 until the packet transmission is completed.
[0067] S4 estimates the link bandwidth using each ACK instead of using the average round trip time. This ACK-based estimation method allows the sender to quickly reach a high bandwidth. S4 updates the link congestion window and performs congestion control based on the link available bandwidth and the smoothed round trip time RTT, specifically including the following steps:
[0068] S4-1. Use each ACK to estimate the link bandwidth. Let t n is the arrival time of the nth ACK, X n is the number of newly received ACK packets since the previous ACK;
[0069] S4-2. When the second ACK is received, the estimation begins and the first estimation is recorded as:
[0070]
[0071] For the subsequent ACK (n>=3),
[0072]
[0073] Among them, sRTT is the smoothed RTT during estimation; the smoothed RTT is obtained by filtering the instantaneous RTT, which is estimated based on the arrival time of the ACK and the sending time of the received ACK packet record, that is:
[0074] iRTT=t acked -t sent
[0075] The iRTT in the formula is the instantaneous RTT;
[0076] S4-3. The smoothed RTT after receiving the nth ACK is calculated as:
[0077] sRTT n =α*sRTT n-1 +(1-α)*iRTT
[0078] In addition to sRTT n In addition, SC-UDP also tracks the minimum iRTT in the past 10 seconds, denoted as RTTmin;
[0079] S4-4. Calculate the congestion window size of the sender when receiving each ACK:
[0080] CWND n =BW n *RTTmin
[0081] When the bandwidth BW2 is large, it may cause a sharp increase in the instantaneous congestion window and burst traffic to be injected into the network, resulting in buffer overflow loss.
[0082] Although the congestion window of the transmission system of the present invention is insensitive to packet loss, this loss may cause a surge in packet queuing and decoding delays. Therefore, when such a surge occurs, we adjust the congestion window at a rate of γBWn, in this example γ=2.
[0083] S6 includes the following steps:
[0084] S6-1, let i seq Indicates the number of the most recently sent uncoded source packet, initialize i seq = -1, every time a source packet is sent, i seq Add 1; the repair group is expressed as:
[0085]
[0086] The repair packet is a linear combination of the source packets that have been sent, where c k is the repair group numbered k; g k,i From a finite field The stream coding coefficients randomly extracted from , k = 0, 1, 2, 3, ... are the numbers of the repair packets; w s The number corresponding to the earliest source packet in the current sending queue;
[0087] S6-2, Initialize w s = 0, according to the feedback from the receiving end, the original packet that has been confirmed to be received will be removed from the queue. At this time, w s Will be updated; let w e =i seq ,[w s , w e ] is called the coding window of the current repair group;
[0088] S6-3, the sender selects the type of packet to be sent based on the packet loss rate of the current link and implements the sending action; when the current repair insertion frequency is lower than When, that is:
[0089]
[0090] Send repair packets, otherwise send source packets; and are the current time t c the number of source packets and repair packets sent by the sender, The calculation formula for smoothing the packet loss rate is similar to that for smoothing RTT, δ∈(0,1).
[0091] S7 includes the following steps:
[0092] S7-1, let i ord Indicates the latest ordered transmission group number, initialize i ord = -1, the decoder is initially in an ordered state; S7-2, when the next packet received by the decoder is neither S iord+1 Nor is it w e =iord If a repair packet with the characteristics of i is found, the ordered transmission is interrupted; the decoder enters the out-of-order state, at which time the decoder will buffer the received packets and try to decode them; the buffered packets are out-of-order source packets, and their numbers are greater than i ord +1 or fix grouping where w e >i ord +1;
[0093] S7-3, Order And order The maximum number of the upper bound of the coding window in the buffered repair group; is called the decoder's current decoding window; as the number of buffered packets increases, the window may expand, i.e. Growth; The decoder uses Gaussian elimination to decode, that is, dynamically constructs a linear equation system AS=B and performs forward elimination online, where the rows of A and B are the coding coefficients and coded information symbols of the buffered packets, respectively, and the disordered source packets are regarded as special repair packets with only one non-zero element 1 in the coding coefficients;
[0094] S7-4, when the decoding is successful, all the decoded source packets in the decoding window are transmitted to the upper layer application, and the decoder is restored to the ordered state, and the ordered transmission is completed. Restart; after receiving is completed, send feedback information to the sending end.
[0095] like Figure 2 As shown, a packet transmission system based on a packet transmission method driven by stream coding and bandwidth estimation includes a transmitting end, a receiving end, a state estimation unit, a stream coding transmission unit, a congestion and FEC control unit and other auxiliary units; the transmitting end is used to send packets, and the packets are uncoded source packets or coded repair packets;
[0096] The receiving end is provided with a decoder for decoding the received packets and transmitting them to the upper layer application in an orderly manner. At the same time, the receiving end also sends feedback information to the sending end. The feedback information includes the ID of the ACK packet, the orderly identification of the receiving end, the number of received source packets, the number of received repair packets and the latest received packet information. The latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type, and the number of actions of doing nothing;
[0097] The state estimation unit includes bandwidth estimation, round-trip time estimation, and packet loss rate estimation, providing link space perception capability for the packet transmission system;
[0098] The stream coding transmission unit provides encoding and decoding functions of stream coding transmission; the stream coding transmission unit adopts a packet-level active forward error correction code based on packet loss rate, namely, stream coding, and predictively sends repair packets based on the estimation of link packet loss rate to replace the retransmission caused by packet loss in traditional congestion control;
[0099] The congestion control and FEC unit provides congestion control capability in packet transmission and the ability to adaptively adjust the FEC code rate;
[0100] Other auxiliary units are used to ensure the reliability and integrity of the packet transmission protocol; the auxiliary units mainly include functions such as initial information exchange, data transmission end, timeout timing, etc.
[0101] The present invention uses stream coding to achieve lost packet recovery, proposes a packet loss recovery scheme without transport layer retransmission, provides a reliability mechanism for UDP transmission, significantly reduces the high-end end-to-end ordered delivery delay caused by retransmission in long-delay links, and achieves a smoother effective throughput, which is very beneficial for streaming media and interactive applications. The present invention also uses a congestion control method based on bandwidth estimation, which estimates the current bandwidth, round-trip delay and packet loss rate of the link by processing the feedback information of the receiving end, dynamically adjusts the packet sending interval, and automatically selects the type of packet to be sent, which solves the problem of frequent decrease of the congestion window caused by random packet loss and improves the effective throughput of the link.
[0102] The specific implementation scheme described above further describes in detail the purpose, technical scheme and beneficial effects of the present invention. It should be understood that the above is only a specific implementation scheme of the present invention and is not intended to limit the scope of the present invention. Any equivalent changes and modifications made by any technician in the field without departing from the concept and principle of the present invention should fall within the scope of protection of the present invention.
Claims
1. A packet transmission method based on stream coding and bandwidth estimation driving, characterized in that: The following steps are involved: S1, the connection between the sender and the receiver is initialized, and then the receiver sends a file request; S2, the sending end receives the file request, opens the file to obtain the content and initializes the transmission parameters, and then packs the MetaInfo group and sends it to the receiving end; the MetaInfo group includes the requested file name, the requested file size, the sending port, the number of source packets to be sent, and the stream coding parameters; the stream coding parameters include the Galois field, the transmission packet size, the frequency of sending the repair packet, and the random coding coefficient seed; S3, the receiving end accepts MetaInfo and feedbacks that MetaInfo has been accepted; MetaInfo is used to initialize stream encoding parameters; the receiving end stream codec is initialized and waits for the arrival of new packets; S4, the sending end processes the feedback information of the receiving end, and estimates the link available bandwidth and smoothed round-trip time RTT; Update the link congestion window and perform congestion control according to the link available bandwidth and smoothed round-trip time RTT; estimate the link packet loss rate based on the feedback information of the receiving end; S5: The sender determines whether there is any congestion window remaining. If there is no congestion window remaining, S5 is repeated. S6. The transmitting end selects the type of packet to be sent based on the current link packet loss rate and implements the sending action; the type of packet includes an uncoded source packet and a coded repair packet; S7, the receiving end decodes and recovers the received packets and transmits them to the upper layer in order; If packet loss occurs, the received repair packet is used to recover the data without notifying the sender to retransmit; After receiving, feedback information is sent to the sending end; the feedback information includes the ID of the ACK packet, the ordered identifier of the receiving end, the number of source packets received, the number of repair packets received, and the latest received packet information; The latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type and the number of packets that do nothing; S8, repeat S4 to S7 until the packet transmission is completed; The S6 comprises the following steps: S6-1, let i seq Indicates the number of the most recently sent uncoded source packet, initialize i seq = -1, every time a source packet is sent, i seq Add 1; the repair group is expressed as: The repair packet is a linear combination of the source packets that have been sent, where c k is the repair group numbered k; g k,i From a finite field The stream coding coefficients randomly extracted from , k = 0, 1, 2, 3, ... are the numbers of the repair packets; w s The number corresponding to the earliest source packet in the current sending queue; S6-2, Initialize w s = 0, according to the feedback from the receiving end, the original packet that has been confirmed to be received will be removed from the queue. At this time, w s Will be updated; let w e =i seq ,[w s , w e ] is called the coding window of the current repair group; S6-3, the sender selects the type of packet to be sent based on the packet loss rate of the current link and implements the sending action; when the current repair insertion frequency is lower than When, that is: Send repair packets, otherwise send source packets; and are the current time t c the number of source packets and repair packets sent by the sender, is the smoothed packet loss rate, δ∈(0,1); The S7 comprises the following steps: S7-1, let i ord Indicates the latest ordered transmission group number, initialize i ord = -1, the decoder is initially in an ordered state; S7-2, when the next packet received by the decoder is neither S iord+1 Nor is it w e =i ord If a repair packet with the characteristics of i is found, the ordered transmission is interrupted; the decoder enters the out-of-order state, at which time the decoder will buffer the received packets and try to decode them; the buffered packets are out-of-order source packets, and their numbers are greater than i ord +1 or fix grouping where w e >i ord +1; S7-3, Order And order The maximum number of the upper bound of the coding window in the buffered repair group; is called the decoder's current decoding window; as the number of buffered packets increases, the window may expand, i.e. Growth; The decoder uses Gaussian elimination to decode, that is, dynamically constructs a linear equation system AS=B and performs forward elimination online, where the rows of A and B are the coding coefficients and coded information symbols of the buffered packets, respectively, and the disordered source packets are regarded as special repair packets with only one non-zero element 1 in the coding coefficients; S7-4, when the decoding is successful, all the decoded source packets in the decoding window are transmitted to the upper layer application, and the decoder is restored to the ordered state, and the ordered transmission is completed. Restart; after receiving is completed, send feedback information to the sending end.
2. A packet transmission method based on stream coding and bandwidth estimation drive according to claim 1, characterized in that: The step S4 of updating the link congestion window and performing congestion control according to the link available bandwidth and the smoothed round trip time RTT specifically includes the following steps: S4-1. Use each ACK to estimate the link bandwidth. Let t n is the arrival time of the nth ACK, X n is the number of newly received ACK packets since the previous ACK; S4-2. When the second ACK is received, the estimation begins and the first estimation is recorded as: For subsequent ACK, when n>=3, Among them, sRTT is the smoothed RTT during estimation; the smoothed RTT is obtained by filtering the instantaneous RTT, which is estimated based on the arrival time of the ACK and the sending time of the received ACK packet record, that is: iRTT=t acked -t sent The iRTT in the formula is the instantaneous RTT; S4-3. The smoothed RTT after receiving the nth ACK is calculated as: sRTT n =α*sRTT n-1 +(1-α)*iRTT The minimum iRTT in the past 10 seconds is denoted as RTTmin; S4-4. Calculate the congestion window size of the sender when receiving each ACK: CWND n =BW n *RTTmin When the bandwidth BW2 is large, it may cause a sharp increase in the instantaneous congestion window and burst traffic to be injected into the network, resulting in buffer overflow loss.
3. A packet transmission system according to any one of claims 1 to 2, characterized in that: It includes a transmitter, a receiver, a state estimation unit, a stream coding transmission unit, a congestion and FEC control unit and other auxiliary units; The transmitting end is used to send a packet, wherein the packet is an uncoded source packet or a coded repair packet; The receiving end is provided with a decoder for decoding the received packets and transmitting them to the upper layer application in an orderly manner. At the same time, the receiving end also sends feedback information to the sending end, and the feedback information includes the ID of the ACK packet, the orderly identification of the receiving end, the number of received source packets, the number of received repair packets and the latest received packet information; The latest received packet information includes the type of the latest received packet, the ID of the packet, the time when the packet is received, the number of received packets of another type, and the number of actions of doing nothing; The state estimation unit includes bandwidth estimation, round-trip time estimation, and packet loss rate estimation, providing link space perception capability for the packet transmission system; The stream coding transmission unit provides encoding and decoding functions of stream coding transmission; the stream coding transmission unit adopts a packet-level active forward error correction code based on packet loss rate, namely, stream coding, and predictively sends repair packets based on the estimation of link packet loss rate to replace the retransmission caused by packet loss in traditional congestion control; The congestion control and FEC unit provides congestion control capability in packet transmission and the ability to adaptively adjust the FEC code rate; Other auxiliary units are used to ensure the reliability and integrity of the packet transmission protocol; the auxiliary units include initial information exchange, data transmission end, and timeout timing functions.
Citation Information
Cited By
Apparatus, system, and method of wireless communication based on a network coding (NC) scheme
US12706721B2
Apparatus, system, and method of wireless communication based on a network coding (NC) scheme
US20230036520A1
