CN110391879A - Loss recovery method, device and the computer equipment of data transmission network - Google Patents
Loss recovery method, device and the computer equipment of data transmission network Download PDFInfo
- Publication number
- CN110391879A CN110391879A CN201910633952.XA CN201910633952A CN110391879A CN 110391879 A CN110391879 A CN 110391879A CN 201910633952 A CN201910633952 A CN 201910633952A CN 110391879 A CN110391879 A CN 110391879A
- Authority
- CN
- China
- Prior art keywords
- packet
- data
- path
- transmission
- transmission path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0882—Utilisation of link capacity
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application provides a kind of loss recovery methods of data transmission network, device and computer equipment, coding packet is generated by the way of coding carries out loss recovery, it is not based on all data packets being detained in data packet transmit queue, active retransmission is successively carried out since the smallest data packet of packet sequence number, namely when it is organic will do it active retransmission when, according to the network state of multi-path data transmission network, to not receiving receiving end feedback acknowledgment character and the doubtful lost data packets not being encoded encode, all possible data packets lost are encoded together, generate coding packet, then, coding packet is rapidly sent to receiving end by optimal transmission paths, so that transmitting terminal " can always transmit again " data packet of actual loss, without which packet loss that calculates to a nicety, it is improved while saving system resource Loss recovery efficiency.
Description
Technical field
This application involves communication technique field, more particularly to a kind of loss recovery method of data transmission network, device,
Computer equipment and storage medium.
Background technique
TCP (Transmission Control Protocol, transmission control protocol) is most of modern times online Web
The bottom transport protocol of (World Wide Web, global wide area network) service.Its transmission time is to Web service performance to Guan Chong
It wants, multi-path transmission control protocol MultiPathTCP (hereinafter referred to as MPTCP), is to allow transmission control protocol (TCP) even
It connects and carrys out the agreement that maximum channel resource uses using multiple paths.MPTCP definition has multiple congestion control mechanisms, supports superfluous
Entire message transmission rate is increased to the summation of all available channels by the inverse multiplexing of remaining channel resource.However,
In MPTCP/TCP, because Network status is bad packet loss may occur for data, and data-bag lost is to lead to MPTCP/TCP
It can low most important factor., therefore, it is necessary to carry out active recovery before data packet is detected loss.
However, this makes in information section currently, the bandwidth of internet path (especially mobile device) is usually relatively small
The chance that point carries out packet loss active retransmission while abiding by congestion control is very limited, existing under the conditions of limited in this way
Multipath loss recovery method, be which data packet is lost due to that can not predict, therefore be to work as transmission network by the way of
When available free congestion window and not new data are sent in network, by the data packet of delays all in transmit queue, from sequence
Number the smallest data packet starts successively to carry out active retransmission, and the usually the smallest data packet of sequence number is not the data really lost
Packet, therefore after needing to retransmit a certain number of redundancy packets, it could successfully restore the data packet really lost, the re-transmission of several mistakes will
The efficiency for even offsetting active loss recovery can be weakened significantly, and cause system resource waste.
Summary of the invention
Based on this, it is necessary to loss recovery low efficiency for existing loss recovery mechanism and what is resulted in waste of resources ask
Topic, provides loss recovery method, device, computer equipment and the storage medium of a kind of efficient data transmission network.
A kind of loss recovery method of data transmission network, method include:
The network state of multi-path data transmission network is obtained, network state includes idle congestion window number, each transmission
The round-trip delay and packet loss in path；
It is not counted newly when existing in idle congestion window and multi-path data transmission network in multi-path data transmission network
When according to that need to transmit, according to the round-trip delay and packet loss of each transmission path, select optimal in multi-path data transmission network
Transmission path and worst transmission path；
Packet loss based on network state and worst transmission path, to the first doubtful lost data packets of worst transmission path into
Row coding obtains coding packet, and the first doubtful lost data packets are not receive receiving end feedback acknowledgment character and be not encoded
Data packet；
Coding packet is sent to receiving end by optimal transmission paths.
In one of the embodiments, according to the round-trip delay and packet loss of each transmission path, multipath number is selected
Include: according to optimal transmission paths in transmission network and worst transmission path
Obtain each transmission path present packet loss and total packet loss；
Present packet loss and total packet loss to each transmission path are weighted processing, obtain estimating for each transmission path
Packet loss；
Processing is weighted to the round-trip delay for estimating packet loss and each transmission path of each transmission path, obtains each transmission
The Measure Indexes value in path；
According to Measure Indexes value, optimal transmission paths and worst transmission path in multi-path data transmission network are selected.
In one of the embodiments, according to Measure Indexes value, optimal transmission in multi-path data transmission network is selected
Path and worst transmission path include:
The smallest transmission path of Measure Indexes value is determined as optimal transmission paths；
The maximum transmission path of Measure Indexes value is determined as worst transmission path.
Network state includes single encoded piece of maximum coding packet number in one of the embodiments,；Based on network-like
The packet loss of state and worst transmission path, carrying out coding to the first doubtful lost data packets of worst transmission path includes:
Obtain the number for estimating packet loss and the first doubtful lost data packets of worst transmission path；
According to the maximum coding packet number for estimating packet loss and single encoded piece of worst transmission path, current compile is determined
The size of code block, the size of present encoding block are in worst transmission path by data encoded packet number；
Packet loss is estimated according to the size of present encoding block, the numbers of the first doubtful lost data packets, worst transmission path
And single encoded piece of maximum encodes packet number, is carried out using Reed-Solomon encryption algorithm to the first doubtful lost data packets
Coding.
In one of the embodiments, according to worst transmission path estimate packet loss and it is single encoded piece preset in
Maximum coding packet number, determines that the size of present encoding block includes:
When maximum of the size of present encoding greater than single encoded piece encodes packet number, then by the first doubtful lost data packets
Number, the minimum value in the maximum coding packet number of the size of present encoding and single encoded piece, be determined as present encoding
The size of block.
Packet loss based on network state and worst transmission path in one of the embodiments, to worst transmission path
The first doubtful lost data packets encoded, obtain coding packet after, further includes:
The second doubtful lost data packets of worst transmission path are obtained, the second doubtful lost data packets are anti-not receive receiving end
Feedback confirms character and is not predetermined the data packet that mechanism retransmitted, and the second doubtful lost data packets carry data sequence number；
When detecting that multi-path data transmission network has idle congestion window, transmitted again by optimal transmission paths
The smallest data packet of packet sequence number in the doubtful lost data packets of current second.
A kind of loss recovery device of data transmission network, device include:
Network state obtains module, and for obtaining the network state of multi-path data transmission network, network state includes sky
The round-trip delay and packet loss of not busy congestion window number, each transmission path；
There is idle congestion window and multi-path data for working as in multi-path data transmission network in path selection module
When there is no new data that need to transmit in transmission network, according to the round-trip delay and packet loss of each transmission path, multipath is selected
Optimal transmission paths and worst transmission path in data transmission network；
Coding module, for the packet loss based on network state and worst transmission path, to the first of worst transmission path
Doubtful lost data packets are encoded, obtain coding packet, the first doubtful lost data packets be do not receive receiving end feedback acknowledgment character,
And the data packet not being encoded；
Data transmission blocks are sent to receiving end by optimal transmission paths for that will encode packet.
Device in one of the embodiments, further include:
Data packet retransmission module, the second doubtful lost data packets for obtaining worst transmission path, second doubts loss data
Bao Weiwei receives receiving end feedback acknowledgment character and is not predetermined the data packet that mechanism retransmitted, the second doubtful lost data packets
Data sequence number is carried, when detecting that multi-path data transmission network has idle congestion window, passes through optimal transmission paths
Again the smallest data packet of packet sequence number in the doubtful lost data packets of current second is transmitted.
A kind of computer equipment, including memory and processor, memory are stored with computer program, and processor executes meter
It is performed the steps of when calculation machine program
The network state of multi-path data transmission network is obtained, network state includes idle congestion window number, each transmission
The round-trip delay and packet loss in path；
It is not counted newly when existing in idle congestion window and multi-path data transmission network in multi-path data transmission network
When according to that need to transmit, according to the round-trip delay and packet loss of each transmission path, select optimal in multi-path data transmission network
Transmission path and worst transmission path；
Packet loss based on network state and worst transmission path, to the first doubtful lost data packets of worst transmission path into
Row coding obtains coding packet, and the first doubtful lost data packets are not receive receiving end feedback acknowledgment character and be not encoded
Data packet；
Coding packet is sent to receiving end by optimal transmission paths.
A kind of computer readable storage medium is stored thereon with computer program, when computer program is executed by processor
It performs the steps of
The network state of multi-path data transmission network is obtained, network state includes idle congestion window number, each transmission
The round-trip delay and packet loss in path；
It is not counted newly when existing in idle congestion window and multi-path data transmission network in multi-path data transmission network
When according to that need to transmit, according to the round-trip delay and packet loss of each transmission path, select optimal in multi-path data transmission network
Transmission path and worst transmission path；
Packet loss based on network state and worst transmission path, to the first doubtful lost data packets of worst transmission path into
Row coding obtains coding packet, and the first doubtful lost data packets are not receive receiving end feedback acknowledgment character and be not encoded
Data packet；
Coding packet is sent to receiving end by optimal transmission paths.
Loss recovery method, device, computer equipment and the storage medium of above-mentioned data transmission network, are not based on number
According to all data packets being detained in packet transmit queue, actively weight is successively carried out since the smallest data packet of packet sequence number
Pass, but using the mode of coding generate coding packet transmitted, it is, when it is organic will do it active retransmission when, according to more
The network state of path data transmission network, to do not receive receiving end feedback read really symbol and the data packet that was not encoded into
All possible data packets lost are encoded together, generate coding packet, then, rapidly by optimal transmission paths by row coding
Coding packet is sent to receiving end, so that transmitting terminal " can always transmit again " data packet of actual loss, without essence
Which packet loss really predicted, improves loss recovery efficiency while saving system resource.
Detailed description of the invention
Fig. 1 is the applied environment figure of the loss recovery method of data transmission network in one embodiment；
Fig. 2 is the flow diagram of the loss recovery method of data transmission network in one embodiment；
Fig. 3 is the flow diagram encoded in one embodiment to doubtful lost data packets；
Fig. 4 is the detailed process schematic diagram of the loss recovery method of data transmission network in another embodiment；
Fig. 5 is the structural block diagram of the loss recovery device of data transmission network in one embodiment；
Fig. 6 is the structural block diagram of the loss recovery device of data transmission network in another embodiment；
Fig. 7 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
The loss recovery method of data transmission network provided by the present application can be applied to applied environment figure as shown in Figure 1
In, the data transmission network including receiving end, transmitting terminal and multipath, it is assumed that optimal transmission paths are the transmission path in Fig. 1
N, worst transmission path are transmission path 2.The network state of transmitting terminal acquisition multi-path data transmission network, wherein network-like
State includes the round-trip delay and packet loss of idle congestion window number, each transmission path, when in multi-path data transmission network
When there are there is no new data that need to transmit in idle congestion window and multi-path data transmission network, according to the past of each transmission path
Time delay and packet loss are returned, optimal transmission paths and worst transmission path in multi-path data transmission network are selected, is based on net
The packet loss of network state and worst transmission path, to the first doubtful lost data packets (do not receive receiving end feedback acknowledgment character and
The data packet not being encoded, P3 and P4 as shown in figure 1) it is encoded, coding packet C is obtained, finally, by coding packet C by most
Excellent transmission path N is sent to receiving end, and data packet P4 is then transmitted to receiving end by worst transmission path, that is, transmission path 2.
Receiving end receives coding packet C, and the data packet (i.e. P3) of actual loss is recovered according to data packet P4 and coding packet C collective effect,
And data packet P3 is delivered to data buffer zone.Wherein, transmitting terminal is the end host for sending data, and receiving end is to receive data
End host, in being bi-directionally connected of network, end host can be while be transmitting terminal and receiving end, specifically, terminal
It can be, but not limited to be various personal computers, laptop, smart phone, tablet computer and portable wearable device.
In one of the embodiments, as shown in Fig. 2, providing a kind of loss recovery method of data transmission network, with
This method is applied to be illustrated for transmitting terminal, comprising the following steps:
Step S200, obtains the network state of multi-path data transmission network, and network state includes idle congestion window
The round-trip delay and packet loss of several, each transmission path.
Multi-path data transmission network (hereinafter referred to as network) refers to the network comprising a plurality of data transfer path.Confirm word
According with ACK (Acknowledgement confirms character) is a kind of transmission class control that receiving station issues dispatching station in data communication
Character, for indicating that the data sent have confirmed that reception is errorless.It is assisted at TCP/IP (Internet Protocol, Internet protocol)
In view, if recipient successfully receives data, an ack msg can be replied.The lattice that usual ACK character has it to fix
Formula, length scale feed back transmitting terminal by receiving end.When transmitting terminal receives loss recovery instruction, current network can be obtained
Network state will actively carry out loss recovery, network when there is idle congestion window in network and do not have new data transmission
State includes the round-trip delay i.e. RTT (Round-Trip Time, round-trip delay) of idle congestion window number, each transmission path
And packet loss.
Step S400, when there is idle congestion window and multi-path data transmission network in multi-path data transmission network
In when there is no new data that need to transmit, according to the round-trip delay and packet loss of each transmission path, select multi-path data transmission
Optimal transmission paths and worst transmission path in network.
Currently, in the prior art, nearest active loss recovery mechanism is (for ease of description, below by nearest packet loss
Restoration Mechanism is referred to as FUSO), when needing to carry out loss recovery, whether really lost since data packet is verified not yet,
So being difficult to predict which data packet is most possibly lost, therefore, as long as organic will do it active retransmission, will simply weigh
Pass in transmit queue that the smallest data packet of sequence of data packet (is trapped in transmit queue at most in the data packet of not confirmed
Data packet).However, the data packet that the data packet for being detained not confirmed at most is not usually really lost, it is therefore desirable to retransmit
Multiple redundancy packets could successfully be restored to the data packet of correct (really losing).In practical applications, by simply testing
To know, existing loss recovery method, which takes around, retransmits 4-16 redundancy packet, it could successfully restore the data packet lost, in this way,
The overlong time of loss recovery, causes system resource waste to a certain extent.Therefore, the data provided in the present embodiment pass
Defeated Network Packet Loss Restoration Mechanism is (for ease of description, below by data transmission network loss recovery mechanism letter provided by the present application
Referred to as CoFUSO), it is to detect doubtful lost data packets number less than idle congestion window number and multi-path data transmission network
When there is no new data that need to transmit in network, according to the round-trip delay and packet loss of each transmission path, multi-path data biography is selected
Optimal transmission paths and worst transmission path, can be carried out data transmission in defeated network with optimal transmission paths, are promoted data and are passed
Defeated speed.
In one of the embodiments, according to the round-trip delay and packet loss of each transmission path, multipath number is selected
It include: to obtain the present packet loss of each transmission path and always lose according to optimal transmission paths in transmission network and worst transmission path
Packet rate, present packet loss and total packet loss to each transmission path are weighted processing, obtain estimating for each transmission path and lose
Packet rate is weighted processing to the round-trip delay for estimating packet loss and each transmission path of each transmission path, obtains each transmission road
The Measure Indexes value of diameter selects optimal transmission paths and worst transmission path according to Measure Indexes value.
Present packet loss also is understood as nearest packet loss, and in this example, present packet loss lossrate_last is defined
Are as follows: 1 with the ratio between total biography packet number after last retransmit, in case of packet loss, then total biography packet number after retransmitting is set to 1, such as
Fruit did not retransmitted data packet, then present packet loss is 0, total packet loss lossrateallIt is that packet number is passed with total according to total re-transmission packet number
The ratio between be calculated.In practical applications, transmitting terminal needs to monitor and estimate the packet loss of every transmission paths, so as to subsequent
Suitable encoding rate is selected to be encoded.Specifically, can be the present packet loss for obtaining each transmission path and total packet loss,
Present packet loss and total packet loss to each transmission path are weighted processing, then, obtain estimating for each transmission path and lose
Packet rate is L=α1lossrateall+β1lossratelast, it is worst when selecting since the Internet paths may have different delays
When transmission path or optimal transmission paths, it is also contemplated that the round-trip delay RTT of transmission path.Specifically, can be normalization
The packet loss and RTT of all transmission paths, and by after normalization packet loss and RTT weighted value (i.e.) make
Worst transmission path or optimal transmission paths are selected for Measure Indexes value.It, will when selecting transmission path in the present embodiment
The packet loss and RTT of transmission path are taken into consideration, and data are transmitted caused by capable of reducing the delay time difference because of transmission path
Overlong time.
In one of the embodiments, according to Measure Indexes value, optimal transmission in multi-path data transmission network is selected
Path and worst transmission path include: that the smallest transmission path of Measure Indexes value is determined as optimal transmission paths, and measurement is referred to
The maximum transmission path of scale value is determined as worst transmission path.
In practical applications, discovery its data transmission performance of the smallest transmission path of Measure Indexes value is more preferable, discovery measurement
Its data transmission performance of the maximum transmission path of index value is worse, and therefore, the smallest transmission path of Measure Indexes value is determined as
The maximum transmission path of Measure Indexes value is determined as worst transmission path by optimal transmission paths, can guarantee data transmission effect
Rate.
Step S600, the packet loss based on network state and worst transmission path are doubted to the first of worst transmission path and are lost
It loses data packet to be encoded, obtains coding packet, the first doubtful lost data packets are not receive receiving end feedback acknowledgment character and not
The data packet being encoded.
Unlike active loss recovery mechanism FUSO, loss recovery method provided by the present application is not from transmission team
The smallest data packet of packet sequence number is retransmitted in column, but correcting and eleting codes is used to generate coding packet.But work as multipath number
When according in transmission network in the presence of there is no new data that need to transmit in idle congestion window and multi-path data transmission network, it is based on net
The packet loss of network state and worst transmission path encodes doubtful lost data packets, by all possible data packets one lost
Coding is played, therefore, transmitting terminal " can always transmit again " correct data packet, which packet is lost without calculating to a nicety
It loses, because receiving end can decode the data packet of actual loss after receiving other data packets.Specifically, can be basis
The current network state of multi-path data transmission network, the suitable encoding rate of dynamic select are encoded, for example, if worst transmission
Doubtful lost data packets number on path is 10, packet loss 30%, then, that is, predicting can in 10 doubtful lost data packets
3 data packets can be lost, therefore generate 3 coding packets it is necessary to corresponding, if packet loss is 35%, according to packet loss and coding
The corresponding relationship of packet number can generate 3.5 codings packet in theory, but since 3.5 be not integer, it can be used
The mode to round up is rounded coding packet number, i.e., packet loss is 35%, then corresponding to generate 4 coding packets, packet loss
It is 31%, then it is corresponding to generate 3 coding packets.In the present embodiment, according to the current network state of multi-path data transmission network, move
State selects suitable encoding rate to be encoded, and keeps loss recovery efficiency.
As shown in figure 3, network state includes single encoded piece of maximum coding packet number in one of the embodiments,；
Packet loss based on network state and worst transmission path carries out coding packet to the first doubtful lost data packets of worst transmission path
It includes:
Step S602 obtains the number for estimating packet loss and the first doubtful lost data packets of worst transmission path,；
Step S604 encodes packet number according to the maximum for estimating packet loss and single encoded piece of worst transmission path,
Determine that the size of present encoding block, the size of present encoding block are in worst transmission path by data encoded packet number；
Step S606, according to the size of present encoding block, the number of the first doubtful lost data packets, worst transmission path it is pre-
Estimate the maximum coding packet number of packet loss and single encoded piece；
Step S608 encodes the first doubtful lost data packets using Reed-Solomon encryption algorithm.
In the present embodiment, CoFUSO uses a kind of Reed-Solomon (RS) code of systematization to generate coding packet.Tool
Body, in actual experiment, it is found that worst transmission path is to be most likely to occur the transmission path of packet loss, doubts lost data packets
(can be described as single encoded piece), it is assumed that the size of present encoding block is K (initial value 0), and thinks the data of K not confirmed
Packet produces M coding packet, this M coding packet can be used to restore up to M raw data packets, and the size of present encoding block is
By data encoded packet number in worst transmission path.Theoretically, M can be arbitrarily large value and lose to restore any number of
Lose packet.However, in practice, decoding complex degree is with O (M2) increase and increase.In addition, K small as far as possible should connect with reducing
Memory overhead when receiving end buffer area is decoded.Since M affects decoding time, it is contemplated that the RTT of computing cost and network,
Therefore M is set by the upper limit of Mmax, i.e. single encoded piece of maximum coding packet number.Specifically, can be MmaxIt is set as it
Less than 1/4 RTT of decoding time, thus faster than simple re-transmission, it is similar, it is contemplated that the memory source of receiving end, by the upper of K
Limit is set as Kmax, i.e., maximum coded block size.
In order to be further reduced calculating and memory overhead, the present embodiment uses the condition dynamic according to multi-path transmission network
Suitable encoding rate (determining the value of M and K) is selected to be encoded.Specifically, can be for each encoding block, according to most
The maximum coding packet number M for estimating packet loss L and single encoded piece of poor transmission pathmax, present encoding block size K is set
It is set toThat is NucIn minimum value, NucIt is defined as the first doubtful lost data packets number in worst transmission path, according to
The size of present encoding blockThe maximum coding packet number for estimating packet loss L and single encoded piece of worst transmission path
Mmax, using Reed-Solomon encryption algorithm to the first doubtful lost data packets NucIt is encoded.In practical applications, have very big
May beM in a data packetmaxThere is a data packet that can loseSo, it is contemplated that at most
M can be generatedmaxA coding packet, they are usually enough to restore originalThe M lost in a data packetmaxA packet.Further
, in order to reduce computing cost, if single encoded piece of coding packet number M can be reduced without enough raw data packets
To less than Mmax.It is understood that in other embodiments, encryption algorithm can also be except Reed-Solomon encryption algorithm
Except other algorithms.In the present embodiment, using RS encryption algorithm, coding rate is fast, and RS encryption algorithm uses
Line coding is not necessarily to additional buffer area in transmitting terminal.
In one of the embodiments, according to worst transmission path estimate packet loss and it is single encoded piece preset in
Maximum coding packet number determines that the size of present encoding block includes: when the size of present encoding is greater than single encoded piece of maximum
When encoding packet number, then by the number of the first doubtful lost data packets, the size of present encoding and single encoded piece of maximum volume
Minimum value in code packet number, is determined as the size of present encoding block.
The principle of the application encryption algorithm be first encoding by data packet coding as much as possible in a data packet,
Therefore be just to try to once can be data packet N that are all unconfirmed and not being encoded for optimal stateucFull coding into
It goes, but since current conditions are limited, the open ended data packet number in single encoded piece may not have NucIt is so much, situation
It is embodied in:
1)NucGreater than currently setting maximum data packet number K in single encoded piecemax；
2) set do not received in worst transmission path receiving end feedback read really symbol data packet as N, single encoded piece
In maximum coding packet number MmaxIf present network conditions are very poor, by MmaxN may be far smaller than with the value of the obtained K of Luc, example
Such as, it is assumed that Mmax=3, if the first doubtful lost data packets number NucIt is 20, estimating packet loss L is 30%, then will be 20 data
When packet is all encoded into single encoded piece, at this moment, the coding packet number that can correspond to generation is 6, is greater than current single volume due to 6
Maximum coding packet number M in code blockmax(i.e. 3), therefore, current encoding block is unable to satisfy coding requirement, therefore, in order to guarantee
Coding is gone on smoothly, it is desirable to reduce the quantity of N.In this case, it is used in the present embodimentTake minimum value in these three as the data packet number K in single encoded piece,
And M can then be acquired according to K and L.After coding is completed, due to some quilt of unacknowledged data packet in worst transmission path
It encodes into encoding block (assuming that data encoded packet number is K, corresponding to current coded block size K), so NucValue
It needs to update, that is, subtracts the size K of encoding block, that is, have Nuc=Nuc-K.In this implementation, according to network condition, dynamic adjustment coding
Mode can be improved the adaptability of coding mode.
The loss recovery method of above-mentioned data transmission network is not based on all data being detained in data packet transmit queue
Packet, active retransmission is successively carried out since the smallest data packet of packet sequence number, but generates coding using the mode of coding
Packet transmitted, it is, when it is organic will do it active retransmission when, it is right according to the network state of multi-path data transmission network
Do not receive that receiving end feedback reads symbol really and the data packet that was not encoded is encoded, by all possible data packets lost
It encodes together, generates coding packet, then, coding packet is rapidly sent to receiving end by optimal transmission paths, so that sending
End " can always transmit again " data packet of actual loss, without which packet loss that calculates to a nicety, in the system of saving
Loss recovery efficiency is improved while resource.
As shown in figure 4, the packet loss based on network state and worst transmission path in one of the embodiments, to doubting
Lost data packets are encoded, obtain coding packet after, further includes: step S900, obtain worst transmission path second doubt lose
Data packet is lost, the second doubtful lost data packets are not receive receiving end feedback acknowledgment character and be not predetermined what mechanism retransmitted
Data packet, the second doubtful lost data packets carry data sequence number；
When detecting that multi-path data transmission network has idle congestion window, transmitted again by optimal transmission paths
The smallest data packet of packet sequence number in the doubtful lost data packets of current second.
In order to ensure that the re-transmission of lost data packets restores efficiency, need to make full use of transmission opportunity.In practical applications, by
In computing cost, MmaxTherefore usual very little when the packet for all not confirmeds generates coding packet, usually still suffers from sky
Not busy congestion window, it is possible to carry out further actively recovery using such chance.Specifically, if there is further
Transmission opportunity, the loss recovery mechanism CoFUSO of the application will be downgraded to active loss recovery mechanism FUSO, that is, obtain the
Two doubtful lost data packets (do not receive receiving end feedback acknowledgment character and not pre- in current multi-path data transmission network
If the data packet that mechanism retransmitted), and transmitted again in optimal transmission paths in the doubtful lost data packets of current second every time
The smallest data packet of packet sequence number completes the re-transmission of the be detained in currently transmitted queue second doubtful lost data packets with this.
In the present embodiment, mechanism of presetting is active loss recovery mechanism FUSO.Wherein, active loss recovery at most only retransmit it is primary not by
The data packet (not including coding packet) of confirmation, to avoid increasing excessive unnecessary flow to network.
If above-described embodiment describes, wrapped when the transmitting terminal of CoFUSO generates coding, and coding packet is passed through into optimal transmission road
When diameter is sent to receiving end, receiving end can be decoded the coding packet, to restore the data packet really lost.As MPTCP etc.
In multi-path transmission protocol, there is the reception buffer area an of data level in receiving end, and every transmission paths have a virtual reception
Buffer area, in the reception buffer area of the Buffer mapping to data level.It is every transmission road in the receiving end in the present embodiment
Diameter design has one group of additional buffer area to carry out decoding data packet, i.e., data packet buffer is for storing raw data packets, coding packet
Buffer area is for storing coding packet.Since decoding needs data packet and coding packet collective effect, CoFUSO is received in receiving end
After orderly data packet, it is delivered to data level first and is received in buffer area, and is copied into the data packet of transmission path
To decode, each data packet is inserted into the corresponding position in data packet buffer according to its packet sequence number for buffer area.Once
The data packet that receives and coding packet total number are equal to the size of corresponding encoding block, receiving end will decode lost package and by its
Data level is delivered to receive in buffer area.Then, it clears data to wrap in buffer area and coding packet buffer area and belongs to present encoding block
Data packet and coding packet.Data packet buffer is that a largest amount is KmaxCyclic buffer.This ensures to connect in CoFUSO
Receiving end has enough cushion spaces to decode maximum encoding block.When the sequence number of data packet is more than that buffer area limits,
CoFUSO in advance removes first packet of buffer area, to store the newest data packet arrived in buffer area slot milling.Accordingly
The largest amount on ground, coding packet buffer area is Mmax, will according to the coding packet serial number in the transmission path serial number and block of encoding block
In the coding packet buffer area for storing corresponding transmission path in order for encoding packet.In the present embodiment, by the way that additional volume is arranged
The buffer area Ma Bao, and the data packet decoded is delivered to total buffer i.e. data level and receives buffer area, it is extensive packet loss can be reduced
The multiple deadline.
It should be understood that although each step in the flow chart of Fig. 2 to Fig. 4 is successively shown according to the instruction of arrow,
But these steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly state otherwise herein, these
There is no stringent sequences to limit for the execution of step, these steps can execute in other order.Moreover, Fig. 2 is into Fig. 4
At least part step may include that perhaps these sub-steps of multiple stages or stage are not necessarily same to multiple sub-steps
One moment executed completion, but can execute at different times, and the execution in these sub-steps or stage sequence is also not necessarily
Be successively carry out, but can at least part of the sub-step or stage of other steps or other steps in turn or
Alternately execute.
In one of the embodiments, as shown in figure 5, providing a kind of loss recovery device of data transmission network, packet
Include: network state obtains module 410, path selection module 420, coding module 430 and data transmission blocks 440, in which:
Network state obtains module 410, and for obtaining the network state of multi-path data transmission network, network state includes
The round-trip delay and packet loss of idle congestion window number, each transmission path.
There is idle congestion window and multipath number for working as in multi-path data transmission network in path selection module 420
When according to there is no new data that need to transmit in transmission network, according to the round-trip delay and packet loss of each transmission path, multichannel is selected
Optimal transmission paths and worst transmission path in diameter data transmission network.
Coding module 430, for the packet loss based on network state and worst transmission path, to the of worst transmission path
One doubtful lost data packets are encoded, and coding packet is obtained, and the first doubtful lost data packets are not receive receiving end feedback acknowledgment word
Symbol and the data packet not being encoded.
Data transmission blocks 440 are sent to receiving end by optimal transmission paths for that will encode packet.
As shown in fig. 6, the loss recovery device of data transmission network further includes data packet weight in one of the embodiments,
Transmission module 450, the second doubtful lost data packets for obtaining worst transmission path, the second doubtful lost data packets are not receive
Receiving end feedback acknowledgment character and it not being predetermined the data packet that mechanism retransmitted, the second doubtful lost data packets carry data sequence number,
When detecting that multi-path data transmission network has idle congestion window, current the is transmitted again by optimal transmission paths
The smallest data packet of packet sequence number in two doubtful lost data packets.
In one of the embodiments, path selection module 420 be also used to obtain the present packet loss of each transmission path with
And total packet loss, present packet loss and total packet loss to each transmission path are weighted processing, obtain each transmission path
Packet loss is estimated, processing is weighted to the round-trip delay for estimating packet loss and each transmission path of each transmission path, is obtained each
The Measure Indexes value of transmission path selects optimal transmission paths and worst transmission path according to Measure Indexes value.
Path selection module 420 is also used to the smallest transmission path of Measure Indexes value is true in one of the embodiments,
It is set to optimal transmission paths, the maximum transmission path of Measure Indexes value is determined as worst transmission path.
In one of the embodiments, coding module 430 be also used to obtain worst transmission path estimate packet loss and
The number of first doubtful lost data packets, according to the maximum coding packet for estimating packet loss and single encoded piece of worst transmission path
Number determines the size of present encoding block, according to the size of present encoding block, the number of the first doubtful lost data packets, worst biography
The maximum coding packet number for estimating packet loss and single encoded piece in defeated path, using Reed-Solomon encryption algorithm to the
One doubtful lost data packets are encoded.
Coding module 430 is also used to be greater than single encoded piece when the size of present encoding in one of the embodiments,
When maximum coding packet number, then most by the number of the first doubtful lost data packets, the size of present encoding and single encoded piece
Minimum value in big coding packet number, is determined as the size of present encoding block.
The specific restriction of loss recovery device about data transmission network may refer to above for data transmission network
The restriction of the loss recovery method of network, details are not described herein.Each mould in the loss recovery device of above-mentioned data transmission network
Block can be realized fully or partially through software, hardware and combinations thereof.Above-mentioned each module can be embedded in the form of hardware or independence
In processor in computer equipment, it can also be stored in a software form in the memory in computer equipment, in order to
Processor, which calls, executes the corresponding operation of the above modules.
A kind of computer equipment is provided in one of the embodiments, which can be server, in
Portion's structure chart can be as shown in Figure 7.The computer equipment includes that the processor, memory, network connected by system bus connects
Mouth and database.Wherein, the processor of the computer equipment is for providing calculating and control ability.The storage of the computer equipment
Device includes non-volatile memory medium, built-in storage.The non-volatile memory medium be stored with operating system, computer program and
Database.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.It should
The database of computer equipment wraps for storing data.The network interface of the computer equipment is used to pass through with external terminal
Network connection communication.A kind of loss recovery method of data transmission network is realized when the computer program is executed by processor.
It will be understood by those skilled in the art that structure shown in Fig. 7, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
A kind of computer equipment, including memory and processor are provided in one of the embodiments, are deposited in memory
Computer program is contained, which performs the steps of when executing computer program obtains multi-path data transmission network
Network state, network state include the round-trip delay and packet loss of idle congestion window number, each transmission path, work as multipath
When in data transmission network in the presence of there is no new data that need to transmit in idle congestion window and multi-path data transmission network, according to
The round-trip delay and packet loss of each transmission path select optimal transmission paths and worst biography in multi-path data transmission network
Defeated path, the packet loss based on network state and worst transmission path, to the first doubtful lost data packets of worst transmission path into
Row coding obtains coding packet, coding packet is sent to receiving end by optimal transmission paths, the first doubtful lost data packets are not connect
The data packet for receiving receiving end feedback acknowledgment character and not being encoded.
It is also performed the steps of when processor executes computer program in one of the embodiments, and obtains worst transmission
The doubtful lost data packets of the second of path, the second doubtful lost data packets are not receive receiving end feedback acknowledgment character and not pre-
If the data packet that mechanism retransmitted, the second doubtful lost data packets carry data sequence number, when detecting multi-path data transmission network
When network has idle congestion window, data packet sequence in the doubtful lost data packets of current second is transmitted again by optimal transmission paths
The smallest data packet of row number.
It is also performed the steps of when processor executes computer program in one of the embodiments, and obtains each transmission road
The present packet loss of diameter and total packet loss, present packet loss and total packet loss to each transmission path are weighted processing,
Obtain each transmission path estimates packet loss, carries out to the round-trip delay for estimating packet loss and each transmission path of each transmission path
Weighting processing, obtains the Measure Indexes value of each transmission path, according to Measure Indexes value, selects optimal transmission paths and worst biography
Defeated path.
It also performs the steps of when processor executes computer program in one of the embodiments, by Measure Indexes value
The smallest transmission path is determined as optimal transmission paths, and the maximum transmission path of Measure Indexes value is determined as worst transmission road
Diameter.
It is also performed the steps of when processor executes computer program in one of the embodiments, and obtains worst transmission
The number for estimating packet loss and the first doubtful lost data packets in path estimates packet loss and list according to worst transmission path
The maximum coding packet number of a encoding block determines that the size of present encoding block, the size of present encoding block are worst transmission path
On by data encoded packet number, according to the size of present encoding block, the number of the first doubtful lost data packets, worst transmission road
The maximum coding packet number for estimating packet loss and single encoded piece of diameter, is doubted using Reed-Solomon encryption algorithm to first
Lost data packets are encoded.
It also performs the steps of when processor executes computer program in one of the embodiments, when present encoding
When maximum coding packet number of the size greater than single encoded piece, then by the number of the first doubtful lost data packets, present encoding it is big
Minimum value in small and single encoded piece of maximum coding packet number, is determined as the size of present encoding block.
A kind of computer readable storage medium is provided in one of the embodiments, is stored thereon with computer program,
The network state for obtaining multi-path data transmission network is performed the steps of when computer program is executed by processor, it is network-like
State includes the round-trip delay and packet loss of idle congestion window number, each transmission path, when in multi-path data transmission network
When there are there is no new data that need to transmit in idle congestion window and multi-path data transmission network, according to the past of each transmission path
Time delay and packet loss are returned, optimal transmission paths and worst transmission path in multi-path data transmission network are selected, is based on net
The packet loss of network state and worst transmission path encodes the first doubtful lost data packets of worst transmission path, is compiled
Coding packet is sent to receiving end by optimal transmission paths by code packet, and the first doubtful lost data packets are anti-not receive receiving end
Data packet feedback confirmation character and be not encoded.
It is also performed the steps of when computer program is executed by processor in one of the embodiments, and obtains worst biography
The doubtful lost data packets of the second of defeated path, the second doubtful lost data packets be do not receive receiving end feedback acknowledgment character and not by
The data packet that default mechanism retransmitted, the second doubtful lost data packets carry data sequence number, when detecting that multi-path data transmits
When network has idle congestion window, data packet in the doubtful lost data packets of current second is transmitted again by optimal transmission paths
The smallest data packet of sequence number.
It is also performed the steps of when computer program is executed by processor in one of the embodiments, and obtains each transmission
The present packet loss in path and total packet loss, present packet loss and total packet loss to each transmission path are weighted place
Reason, obtain each transmission path estimates packet loss, to the round-trip delay for estimating packet loss and each transmission path of each transmission path
It is weighted processing, obtains the Measure Indexes value of each transmission path, according to Measure Indexes value, selects optimal transmission paths and most
Poor transmission path.
It also performs the steps of when computer program is executed by processor in one of the embodiments, by Measure Indexes
It is worth the smallest transmission path and is determined as optimal transmission paths, the maximum transmission path of Measure Indexes value is determined as worst transmission road
Diameter.
It is also performed the steps of when computer program is executed by processor in one of the embodiments, and obtains worst biography
The number for estimating packet loss and the first doubtful lost data packets in defeated path, according to worst transmission path estimate packet loss and
Single encoded piece of maximum coding packet number determines that the size of present encoding block, the size of present encoding block are worst transmission road
By data encoded packet number on diameter, according to the size of present encoding block, the number of the first doubtful lost data packets, worst transmission
The maximum coding packet number for estimating packet loss and single encoded piece in path, using Reed-Solomon encryption algorithm to first
Doubtful lost data packets are encoded.
It is also performed the steps of when computer program is executed by processor in one of the embodiments, and works as present encoding
Maximum coding packet number of the size greater than single encoded piece when, then by the number of the first doubtful lost data packets, present encoding
Minimum value in size and single encoded piece of maximum coding packet number, is determined as the size of present encoding block.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Instruct relevant hardware to complete by computer program, computer program can be stored in non-volatile computer and can be read
In storage medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the application
To any reference of memory, storage, database or other media used in provided each embodiment, may each comprise non-
Volatibility and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM (PROM),
Electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include arbitrary access
Memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms, such as static
RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhanced SDRAM
(ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) directly RAM (RDRAM), straight
Connect memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
Above embodiments only express the several embodiments of the application, and the description thereof is more specific and detailed, but can not
Therefore it is construed as limiting the scope of the patent.It should be pointed out that for those of ordinary skill in the art, In
Under the premise of not departing from the application design, various modifications and improvements can be made, these belong to the protection scope of the application.
Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of loss recovery method of data transmission network, which is characterized in that the described method includes:
The network state of multi-path data transmission network is obtained, the network state includes idle congestion window number, each transmission
The round-trip delay and packet loss in path；
When there are in the idle congestion window and the multi-path data transmission network in the multi-path data transmission network
When there is no new data that need to transmit, according to the round-trip delay and packet loss of each transmission path, the multipath number is selected
According to optimal transmission paths in transmission network and worst transmission path；
Packet loss based on the network state and the worst transmission path is doubted to the first of the worst transmission path and is lost
Data packet is encoded, obtain coding packet, the first doubtful lost data packets be do not receive receiving end feedback acknowledgment character and
The data packet not being encoded；
The coding is wrapped and is sent to receiving end by the optimal transmission paths.
2. the loss recovery method of data transmission network according to claim 1, which is characterized in that described according to described each
The round-trip delay and packet loss of transmission path select in the multi-path data transmission network optimal transmission paths and worst
Transmission path includes:
Obtain each transmission path present packet loss and total packet loss；
Processing is weighted to the present packet loss and total packet loss of each transmission path, obtains estimating for each transmission path
Packet loss；
Processing is weighted to the round-trip delay for estimating packet loss and each transmission path of each transmission path, obtains institute
State the Measure Indexes value of each transmission path；
According to the Measure Indexes value, optimal transmission paths and worst transmission road in the multi-path data transmission network are selected
Diameter.
3. the loss recovery method of data transmission network according to claim 2, which is characterized in that referred to according to the measurement
Scale value, selecting optimal transmission paths and worst transmission path in the multi-path data transmission network includes:
The smallest transmission path of Measure Indexes value is determined as optimal transmission paths；
The maximum transmission path of Measure Indexes value is determined as worst transmission path.
4. the loss recovery method of data transmission network according to claim 2, which is characterized in that the network state is also
Including single encoded piece of maximum coding packet number；The packet loss based on the network state and the worst transmission path
Rate, carrying out coding to the first doubtful lost data packets of the worst transmission path includes:
Obtain the number for estimating packet loss and the first doubtful lost data packets of the worst transmission path；
Packet loss and single encoded piece of the maximum coding packet number are estimated according to the worst transmission path, determines and works as
The size of preceding encoding block, the size of the present encoding block are in the worst transmission path by data encoded packet number；
It is lost according to the size of the present encoding block, the number of the first doubtful lost data packets, the estimating for worst transmission path
Packet rate and single encoded piece of the maximum coding packet number, are doubted to described first using Reed-Solomon encryption algorithm and are lost
Data packet is lost to be encoded.
5. the loss recovery method of data transmission network according to claim 4, which is characterized in that it is described according to most
Poor transmission path estimate packet loss and it is single encoded piece preset in maximum coding packet number, determine the big of present encoding block
It is small to include:
When maximum of the size of the present encoding greater than described single encoded piece encodes packet number, then described first is doubted and lost
Lose the minimum in the number, the size of the present encoding and single encoded piece of the maximum coding packet number of data packet
Value, is determined as the size of present encoding block.
6. the loss recovery method of data transmission network according to claim 1, which is characterized in that described to be based on the net
The packet loss of network state and the worst transmission path compiles the first doubtful lost data packets of the worst transmission path
Code, obtain coding packet after, further includes:
The second doubtful lost data packets of the worst transmission path are obtained, the second doubtful lost data packets are not receive reception
It holds feedback acknowledgment character and is not predetermined the data packet that mechanism retransmitted, the second doubtful lost data packets carry data sequence
Number；
When detecting that the multi-path data transmission network has idle congestion window, again by the optimal transmission paths
The smallest data packet of packet sequence number in the described second current doubtful lost data packets of transmission.
7. a kind of loss recovery device of data transmission network, which is characterized in that described device includes:
Network state obtains module, and for obtaining the network state of multi-path data transmission network, the network state includes sky
The round-trip delay and packet loss of not busy congestion window number, each transmission path；
Path selection module, for there are the idle congestion windows and described more in the multi-path data transmission network
When there is no new data that need to transmit in path data transmission network, according to the round-trip delay and packet loss of each transmission path,
Select optimal transmission paths and worst transmission path in the multi-path data transmission network；
Coding module, for the packet loss based on the network state and the worst transmission path, to the worst transmission road
The doubtful lost data packets of the first of diameter are encoded, and coding packet is obtained, and the first doubtful lost data packets are not receive receiving end
Feedback acknowledgment character and the data packet not being encoded；
Data transmission blocks are sent to receiving end by the optimal transmission paths for wrapping the coding.
8. multipath loss recovery device according to claim 7, which is characterized in that described device further include:
Data packet retransmission module, the second doubtful lost data packets for obtaining worst transmission path, described second doubts loss data
Bao Weiwei receives receiving end feedback acknowledgment character and is not predetermined the data packet that mechanism retransmitted, and described second doubts loss number
Data sequence number is carried according to packet, when detecting that the multi-path data transmission network has idle congestion window, by described
Optimal transmission paths transmit the smallest data packet of packet sequence number in the described second current doubtful lost data packets again.
9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists
In the step of processor realizes any one of claims 1 to 6 the method when executing the computer program.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 6 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910633952.XA CN110391879B (en) | 2019-07-15 | 2019-07-15 | Packet loss recovery method and device for data transmission network and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910633952.XA CN110391879B (en) | 2019-07-15 | 2019-07-15 | Packet loss recovery method and device for data transmission network and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110391879A true CN110391879A (en) | 2019-10-29 |
| CN110391879B CN110391879B (en) | 2020-08-18 |
Family
ID=68286440
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910633952.XA Active CN110391879B (en) | 2019-07-15 | 2019-07-15 | Packet loss recovery method and device for data transmission network and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110391879B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110868616A (en) * | 2019-11-26 | 2020-03-06 | 上海高骏精视信息技术有限公司 | Low-delay high-reliability video transmission method in 5G network |
| CN111245566A (en) * | 2020-01-09 | 2020-06-05 | 北京创世云科技有限公司 | Method and device for preventing packet loss of unreliable network, storage medium and electronic equipment |
| CN111818231A (en) * | 2020-07-06 | 2020-10-23 | 全时云商务服务股份有限公司 | Packet loss compensation method, device, data message transmission system and storage medium |
| CN112653662A (en) * | 2020-09-17 | 2021-04-13 | 深圳市安赛通科技有限公司 | Method for quickly correcting errors of network transmission protocol |
| CN114979015A (en) * | 2021-02-19 | 2022-08-30 | 腾讯科技（深圳）有限公司 | Data packet processing method and device |
| CN115580379A (en) * | 2022-10-24 | 2023-01-06 | 北京东方正龙数字技术有限公司 | Multilink network transmission method and system |
| WO2023213281A1 (en) * | 2022-05-06 | 2023-11-09 | 阿里巴巴（中国）有限公司 | Multi-path redundant transmission method, user equipment, network entity and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547070A (en) * | 2008-03-24 | 2009-09-30 | 华为技术有限公司 | Method for determining type of data packet and device thereof |
| CN101645765A (en) * | 2009-08-03 | 2010-02-10 | 四川大学 | Reliable transmission acceleration method facing networks with high error rate and long delay characteristics |
| CN102025473A (en) * | 2010-12-30 | 2011-04-20 | 浙江大学 | Retransmission method based on intergenerational network coding in packet network |
| US8024182B2 (en) * | 1999-12-14 | 2011-09-20 | Texas Instruments Incorporated | Rate/diversity adaptation sending speech in first and second packets |
| CN102387559A (en) * | 2010-09-03 | 2012-03-21 | 中兴通讯股份有限公司 | Cross-layer route optimization method and device for wireless Mesh network |
| CN102684856A (en) * | 2011-01-25 | 2012-09-19 | 西安电子科技大学 | Data retransmission method and device |
| CN102843257A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Path estimating method and device |
| CN103840917A (en) * | 2014-03-28 | 2014-06-04 | 北京邮电大学 | Multipath parallel transmission scheme based on network coding |
| CN109936424A (en) * | 2019-03-15 | 2019-06-25 | 重庆邮电大学 | Multi-relay cooperation retransmission algorithm based on hybrid network coding |
-
2019
- 2019-07-15 CN CN201910633952.XA patent/CN110391879B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8024182B2 (en) * | 1999-12-14 | 2011-09-20 | Texas Instruments Incorporated | Rate/diversity adaptation sending speech in first and second packets |
| CN101547070A (en) * | 2008-03-24 | 2009-09-30 | 华为技术有限公司 | Method for determining type of data packet and device thereof |
| CN101645765A (en) * | 2009-08-03 | 2010-02-10 | 四川大学 | Reliable transmission acceleration method facing networks with high error rate and long delay characteristics |
| CN102387559A (en) * | 2010-09-03 | 2012-03-21 | 中兴通讯股份有限公司 | Cross-layer route optimization method and device for wireless Mesh network |
| CN102025473A (en) * | 2010-12-30 | 2011-04-20 | 浙江大学 | Retransmission method based on intergenerational network coding in packet network |
| CN102684856A (en) * | 2011-01-25 | 2012-09-19 | 西安电子科技大学 | Data retransmission method and device |
| CN102843257A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Path estimating method and device |
| CN103840917A (en) * | 2014-03-28 | 2014-06-04 | 北京邮电大学 | Multipath parallel transmission scheme based on network coding |
| CN109936424A (en) * | 2019-03-15 | 2019-06-25 | 重庆邮电大学 | Multi-relay cooperation retransmission algorithm based on hybrid network coding |
Non-Patent Citations (1)
| Title |
|---|
| 李庆华, 陈果, 陈志刚: "基于网络演算的无线自组网TCP丢包率上界研究", 《小型微型计算机***》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110868616A (en) * | 2019-11-26 | 2020-03-06 | 上海高骏精视信息技术有限公司 | Low-delay high-reliability video transmission method in 5G network |
| CN111245566A (en) * | 2020-01-09 | 2020-06-05 | 北京创世云科技有限公司 | Method and device for preventing packet loss of unreliable network, storage medium and electronic equipment |
| CN111818231A (en) * | 2020-07-06 | 2020-10-23 | 全时云商务服务股份有限公司 | Packet loss compensation method, device, data message transmission system and storage medium |
| CN112653662A (en) * | 2020-09-17 | 2021-04-13 | 深圳市安赛通科技有限公司 | Method for quickly correcting errors of network transmission protocol |
| CN114979015A (en) * | 2021-02-19 | 2022-08-30 | 腾讯科技（深圳）有限公司 | Data packet processing method and device |
| CN114979015B (en) * | 2021-02-19 | 2024-04-12 | 腾讯科技（深圳）有限公司 | Data packet processing method and device |
| WO2023213281A1 (en) * | 2022-05-06 | 2023-11-09 | 阿里巴巴（中国）有限公司 | Multi-path redundant transmission method, user equipment, network entity and storage medium |
| CN115580379A (en) * | 2022-10-24 | 2023-01-06 | 北京东方正龙数字技术有限公司 | Multilink network transmission method and system |
| CN115580379B (en) * | 2022-10-24 | 2023-05-16 | 北京东方正龙数字技术有限公司 | Multilink network transmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110391879B (en) | 2020-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110391879A (en) | Loss recovery method, device and the computer equipment of data transmission network | |
| US9271123B2 (en) | Wireless reliability architecture and methods using network coding | |
| US9549338B2 (en) | Method and apparatus for transmitting and receiving data packet in wireless communication system | |
| US7284179B2 (en) | Window based stall avoidance mechanism for high speed wireless communication system | |
| KR102173084B1 (en) | Method and apparatus for transmitting and receiving data packets in a wireless communication system | |
| EP3342073B1 (en) | Random linear network encoded data transmission | |
| US20150117468A1 (en) | Apparatus and method for transmitting data | |
| US9118478B2 (en) | Fault-tolerant data transmission system for networks with non-full-duplex or asymmetric transport | |
| US20040013114A1 (en) | Methods and devices for the retransmission of data packets | |
| CN105450357A (en) | Adjustment method of encoding parameters, adjustment device of encoding parameters, processing method of feedback information and processing device of feedback information | |
| CN102664718B (en) | The method and apparatus that wireless side tcp data retransmits | |
| KR20020042438A (en) | Hybrid ARQ with parallel packet transmission | |
| CN104243096A (en) | Deep space multi-file transmission method based on fountain codes | |
| US20160218837A1 (en) | Method and apparatus to use more transmission opportunities in a distributed network topology with limited harq processes | |
| US6662330B1 (en) | Joint range reject automatic repeat request protocol | |
| CN101088243A (en) | Data flow control with duplicate acknowledgment | |
| TW202105375A (en) | Method for data transmission and RDMA network interface card | |
| CN105164960A (en) | Reduction of retransmission latency by combining pacing and forward error correction | |
| US10200154B2 (en) | System and method for early packet header verification | |
| WO2008032990A1 (en) | Method for preventing consecutive packet errors in selective hybrid arq system | |
| CN103166747A (en) | Method and device of hybrid automatic repeat request (HARQ) merging | |
| CN113438055A (en) | Convolutional network coding transmission method based on unequal redundancy insertion | |
| CN110943803B (en) | Data transmission control method based on erasure coding | |
| EP3487101B1 (en) | Method, receiver and network apparatus for delivering payloads through an interface | |
| CN117499992A (en) | Semantic-based DTN BP and LTP cross-layer bundle transmission method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |