CN103840917B - Multipath parallel transmission scheme based on network coding - Google Patents
Multipath parallel transmission scheme based on network coding Download PDFInfo
- Publication number
- CN103840917B CN103840917B CN201410124188.0A CN201410124188A CN103840917B CN 103840917 B CN103840917 B CN 103840917B CN 201410124188 A CN201410124188 A CN 201410124188A CN 103840917 B CN103840917 B CN 103840917B
- Authority
- CN
- China
- Prior art keywords
- group
- path
- packet
- data
- transmission
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a multipath parallel transmission scheme based on network coding. The multipath parallel transmission scheme solves that problems that when multipath parallel transmission is conducted in a wireless network, packets are lost frequently due to the unreliability of the wireless network and out-of-sequence is caused by the difference of multiple paths. According to the multipath parallel transmission scheme based on network coding, network coding is introduced, the limit that the packets are received in sequence in traditional reliable sequential transmission is broken, and the priority is given to the number of the data packets instead of the sequence of the data packets. Redundant data packets are added according to the packet loss rate, possibly-lost packets in the transmission process is actively supplemented, and retransmission is avoided. Transmission management is conducted in groups, it is guaranteed that a congestion window is increased rapidly and fully, and the tolerance of a system to time-out and packet loss is enhanced. The multipath parallel transmission scheme based on network coding is adopted to conduct wireless multimedia data transmission, the dynamics and the unreliability of a wireless heterogeneous network can be actively prevented, the scheme can be adapted to the dynamics and the unreliability of the wireless heterogeneous network, the out-of-sequence and packet loss problems are solved, retransmission is greatly reduced, the throughput capacity is greatly improved, and efficient high-quality wireless multimedia transmission services are provided.
Description
Technical field
The present invention relates to communication technique field, communication data transmission technology.Tie specifically related on SCTP
Close the realization of the multidiameter delay transmission of network code.
Background technology
With the development of society, people transmit the demand of service for high-quality, high efficiency and convenient multi-media radio
More and more higher.All over the world many cities all for live video stream have established urban network, such as vehicular wireless network.With
The prevalence of ubiquitous broadband mobile network access technology, multidiameter delay transmission CMT (Concurrent Multipath
Transfer) becoming strengthens one of most desirable mode of multimedia transmission.At present, the realization of CMT is based primarily upon flow control biography
Defeated agreement SCTP (Stream Control Transmission Protocol), research shows, SCTP can effectively realize many
Road parallel transmission.SCTP CMT possess preferable aggregated bandwidth ability, fault-tolerance and load balance ability, and these features make it
Effective data transport service can be provided for multimedia content delivery.
However, CMT is having a very serious packet to reset defect.Because multipath has larger path difference
(such as bandwidth, time delay and packet loss), Out-of-sequence packets reach receiving terminal, and receiving terminal needs to be reached on very fast path while caching
Packet, while waiting the packet postponed on slower path, carry out packet rearrangement, it is ensured that the orderly payment of packet.
When Out-of-sequence packets, by limited time, the performance of CMT can be limited the caching of serious and mobile terminal by caching obstruction, cause connection
Into idle condition.Have many research work to be devoted to slow down data rearrangement at present, its significant challenge be how it is determined that
Data dispatch is carried out under path evaluation.These researchs are all deferred to strict ordered data and are received, and its transmission performance is still passively
Affected by the data rearrangement in order caching.
It is that the unreliability of wireless channel causes packet loss and re-transmission Jing often to occur that another needs concern.In order to
The purpose of reliable data transmission is reached, sometimes for same packets need carries out re-transmission more than once.In such case
Under, judge that packet loss reason is congestion or wireless mistake is very important.Some research work attempt the reliability for strengthening CMT
Property, save the expense for retransmitting.These researchs consider the uniqueness of single packet, carry out the loss detection of packet.However, this
Re-transmission can hardly be reduced.
In recent years, for the research of network code shows, transport layer network coding can provide a kind of simple method and beat
Strong constraint relation between broken packet and transmission serial number TSN.Although this constraining in reliable order transfer is very heavy
Want, but the final purpose of actually transport layer is to carry out reliable data transfer.So, receiving terminal is only concerned packet arrival
Quantity, without concern for packet reach order, it is not necessary to reordered.Furthermore, when there is packet loss, coding bag can be with
Substitute mutually and supplement, it is not necessary to retransmit specific packet.In TCP or SCTP, coding and decoding is calculated can be to the reply for confirming
Larger delay is brought, under causing HARQ ARQ (Automatic Repeat reQuest) and the performance of congestion control
Drop.The proposition of Online ACK mechanism can solve the problem so that network code compatible with TCP and can be performed effectively.Subsequently,
Network code and online ACK mechanism are applied in MPTCP, can improve the handling capacity of multi-path network.However, by
It is a newer idea being transplanted to SCTP CMT on TCP in MPTCP, does not form standard.Furthermore, MPTCP is not
Complete characteristic with SCTP, such as flexible multi-block data bag form heartbeat mechanism and selects to confirm that these characteristics can be with
Network code cooperation, optimizes its performance.Existing research simultaneously also without reference to optimization congestion control and is distinguished in wireless environment
Packet loss reason.
The content of the invention --- claims forms part
In view of this, the present invention proposes a kind of multidiameter delay transmission plan based on network code, in flow control transmission
In the multidiameter delay transmitting procedure of agreement, with reference to network code, break traditional transmitting thought of received in-order, eliminate data
The uniqueness of bag, there is provided high performance multi-medium data transmission service.Invention defines the network code fortune based on group
Calculate, according to the raw data packets in a group network code bag is generated；A mixing rapid data distribution policy is employed, is chosen
Path with maximum receiving space carries out data distribution, and adds redundancy on demand；A group transfer management mechanism is proposed, is entered
Row congestion control, re-transmission etc. are managed.The present invention can be effectively prevented from packet rearrangement, compensate lose packet, solve because
The caching obstruction that path diversity and mobile terminal storage are limited and caused, actively adapts to the dynamic of wireless network, is mobile
User provides efficient multimedia transmission.
1st, a kind of multidiameter delay transmission method based on network code, its step includes：
A) the network code computing based on group, using bandwidth and packet loss determination group number, to the packet in a group
Carry out linear combination network code；Comprise the following steps that：
(1) for path i, the round-trip delay RTT in the path is determined by following formula：
Wherein, SRTTiRepresent the smooth roundtrip time delay of path i, RRTTiRepresent the reference round-trip delay of path i, a<1 and b>
1 is the boundary factor of round-trip delay RTT；
(2) the estimation measurement of bandwidth BW：
First, when a group number needs to update, according to the bandwidth sample of following formula collecting path i：
Wherein sendsizeiIt is to terminate to data is activation amount this moment, Tl from last time samplingiAnd TeiRespectively at this
Last packet leaves path i cachings and first packet into the time of the caching in the section time；
Secondly, in order to eliminate fluctuation, bandwidth sample is smoothed, obtains estimated result：
Wherein T0For bandwidth smoothing factor, BWpreviousiFor a upper estimated result；
(3) measurement of packet loss pe：Packet loss pe is provided by transport management module；
(4) according to following formula renewal group number N:
Wherein, MTU represents MTU.
B) mix rapid data distribution policy, select that there is the path of maximum receiving space to carry out data distribution, often distribute
Complete one group of data, all add certain redundant data packets at path caching end；
C) transfer management mechanism is organized, is transmitted management in units of group, including congestion control, necessary re-transmission and lost
The record of bag rate updates.
2nd, a kind of multidiameter delay transmission method based on network code as claimed in claim 1, it is characterised in that be based on
The network code computing of group, including：
A) two-way time RTT measurements：Send heartbeat packet HEARTBEAT to obtain with reference to two-way time RRTT, contrast smooths past
Time SRTT is returned, when RRTT and SRTT are close, the value of SRTT is selected as the RTT in path；When RRTT and SRTT gaps it is larger
When, RRTT is selected as the RTT in path；
B) bandwidth BW is estimated：Bandwidth sample is worth to by the traffic volume of data in time of measuring interval and the ratio of time of measuring
This, then be smoothed and obtain bandwidth estimation value；
C) organize number to update：Using two-way time RTT, bandwidth BW and packet loss pe determination group numbers；
D) network code bag is generated：According to a group number division group, linear combination coding is carried out to the packet in a group,
And in the packet insert corresponding encoded information.
3rd, a kind of multidiameter delay transmission method based on network code as claimed in claim 1, it is characterised in that mixing is fast
Fast data distribution strategy, including：
A) Path selection：Select that there is the path of maximum receiving space to carry out data distribution, wherein maximum receiving space is
Refer to, at a time path allows the data volume that send and can be successfully received；
B) redundancy is added：The packet number and packet loss being fitted on certain path according to certain component carries out redundancy meter
Calculate, add redundant data packets, it is ensured that the data packet number that receiving terminal can be successfully arrived on the independent pathway distributes not less than it
Packet number.
4th, a kind of multidiameter delay transmission method based on network code as claimed in claim 1, it is characterised in that group is passed
Defeated administrative mechanism, including：
A) congestion control based on group：For group GC for currently pointing to, GC represent current not yet receiving end be successfully decoded,
The group for sending earliest, if selecting to confirm that SACK confirms a new transmission serial number TSN in GC, execution starts slowly or congestion
Avoid algorithm；If the loss report of GC is reached more than three times, corresponding Fast retransmission algorithm is performed according to packet loss reason；If group time-out
GTO, then carry out the Retransmission timeout algorithm of normal stream transmission control protocol SCTP；
B) packet loss pe is calculated：For group GP for being recently completed transmission, GP is before GC, nearest decoding success
Group, records GP on each path by the sum for sending packet and the packet being properly received, and calculates the packet loss in each path.
The present invention has the following technical effect that：
1st, in the present invention, network code is carried out in units of group and mixes transmission coding bag or raw data packets.No
Pipe packet can regard the coding bag through linear combination as either with or without being encoded.So, each coding is wrapped only
Represent a relation of group, coding bag is not independent and unique, and the coding bag of any loss can be with belonging to the group
Other coding bags replace, while without order between the coding bag in same group.As long as receiving terminal receives the volume of enough numbers
Code bag, can just translate initial data, it is not necessary to consider Out-of-sequence packets problem, and appropriate redundancy can also greatly reduce or even avoid
Retransmit.
2nd, in the present invention, control is transmitted in units of group.Transmitting terminal concern belongs to the confirmation message of a group, and
It is not the confirmation message of some packet.As long as confirming that the TSN for belonging to current group, cwnd just can accordingly be increased in SACK
It is long；SACK do not confirm for continuous more than three times it is any belong to current group TSN when, be carried out Fast retransmission；GTO is overtime, performs
Retransmission timeout.Congestion control in units of group, it is ensured that cwnd's tells growth, simultaneously for the tolerance to bag and time-out
Property is greatly enhanced.
Description of the drawings
Fig. 1 is the overall system architecture of the present invention；
Fig. 2 is multi-path network coding principle figure；
Fig. 3 is group number update algorithm flow chart；
Fig. 4 is network code bag bag form schematic diagram；
Fig. 5 is rapid data distribution algorithms flow chart；
Fig. 6 is that path caches occupancy situation schematic diagram；
Fig. 7 is group transfer management algorithm flow chart.
Specific embodiment
To readily appreciate the technological means of the present invention, creation characteristic, reached purpose and effect, below in conjunction with accompanying drawing and
The present invention will be described in detail for specific embodiment.
1st, overall system architecture figure
In order to solve in SCTP CMT, because the multiformity in path causes data reordering and packet loss, to ultimately result in biography
The problem of defeated hydraulic performance decline, the present invention proposes a kind of multidiameter delay transmission plan based on network code.As shown in figure 1, i.e.
For the overall system architecture of the present invention, including transmitting terminal, the multipath on receiving terminal and wireless network.
BW＆RTT estimation module computation bandwidth BW and two-way time RTT, transport management module calculates packet loss pe.By bandwidth
BW, two-way time RTT and packet loss pe determine every time to encode how many packets (being represented with N).This group carries number
According to block DATA chunks and the continuous packets of TSN are referred to as group (Group) (in Fig. 1 blue square frame shown in).Carry other blocks
The packet of (for example controlling) is not grouped and is encoded, and is sent only in accordance with usual mode.
Packet is grouped and is adaptive selected path and carried out data transmission by blended data distribution module.Network encoder
Random selection packet carries out network code, raw data packets (white) is so mixed with the caching of path and coding bag is (yellow
Color).In order to correct quick decoding, the two modules need to add some redundant data packets.Although arranging redundancy can increase
The quantity of packet is sent, it is contemplated that appropriate redundancy can guarantee that enough packets reach receiving terminal, so as to subtract in a large number
It is few to retransmit, so addition redundant data packets are worth.Meanwhile, transport management module receives SACKs to obtain packet reception
State, safeguards congestion control, and judges whether to be necessary to be retransmitted.Its transfer management is based on group rather than as standard SCTP
Like that in units of packet.
In receiving terminal, packet is first stored in order caching, is then submitted to network transcoders and is entered row decoding, recovers former
Beginning packet.Then, these packets will be assembled and consign to application layer.Finally, receiving terminal replys SACK.
2nd, multi-path network coding principle
The principle of multi-path network coding is as shown in Figure 2.Transmitting terminal is by raw data packets S1-S4A group is divided into, G is used
Represent, line assembly coding of going forward side by side.Either send raw data packets and still encode bag, they contain code coefficient.
It is no longer application layer data that this is caused entrained by the packet for sending, but represents the relation between initial data.Therefore,
Receiving terminal there is no need strict received in-order packet, it is only necessary to caches these packets and extracts the relation between them and (is
Number).Additionally, it is of equal value between each packet, can be interchangeable between these information, the packet of any loss can be by other
Packet supplement.So, as long as receiving terminal collects sufficient amount of packet (in theory 4), it becomes possible to by Gauss
Elimination correct decoding goes out raw data packets, while also without the packet or re-transmission that consider other loss.Generally speaking,
By network code, packet is no longer uniquely determined by their TSN, and receiving terminal no longer needs rearrangement, while transmitting terminal
Also substantially reduce the number re-transmission.
3rd, the network code computing based on group
The matter of utmost importance of planned network coding is that each group needs comprising how many packets, that is, to organize number N.In order to reach compared with
Low buffer size but while guarantee to carry out sufficient out of order compensation, group number needs to be suitably above the number of out-of-sequence packet
Amount.When retransmitting, explanation group number has lagged behind the change of multi-path environment, then according to time delay, bandwidth and packet loss
Update N.
Time delay is the RTT times of BW＆RTT estimation modules measurement.Because SCTP CMT are allowed different from corresponding data bag
Path on reply SACK, common SRTT (Smoothed RTT) metering system may be inaccurate.SCTP is path detection
There is provided heartbeat mechanism, its require HEARTBEAT_ACK with HEARTBEAT identicals path on reply.When needing renewal group
During number, two HEARTBEATs are sent, wait two HEARTBEAT_ACKs to be all properly received, can thus obtain the two
The RTT times of HEARTBEATs simultaneously select smaller value therein as the RRTT (Reference RTT) in path.If SRTT and
RRTT is close to, and illustrate that the reverse-path of very possible SACK and the transmitting path of packet are identicals, or its forward direction and instead
There is identical time delay to path, now, it is contemplated that the estimation of SRTT is based on great amount of samples, and its result is more accurate, I
Select SRTT as path RTT；Conversely, SRTT and RRTT gaps are larger, then RRTT is selected as path RTT.For path
I, we determine the RTT in path by following formula：
Wherein a<1 and b>1 is RTT boundary factors.
Bandwidth BW is equally measured by BW＆RTT estimation modules.It is by the conversions concepts of bandwidth：The value of available bandwidth is equal to number
According to traffic volume and the ratio of transmission time.When a group number needs to update, according to the bandwidth sample of following formula collecting path i：
Wherein sendsizeiIt is to terminate to data is activation amount this moment, Tl from last time samplingiAnd TeiRespectively at this
Last packet leaves path i cachings and first packet into the time of the caching in the section time.In order to eliminate ripple
It is dynamic, bandwidth sample is smoothed, obtain estimated result：
Wherein T0For bandwidth smoothing factor, BWpreviousiFor a upper estimated result.
Packet loss is provided by transport management module, and this will be referred in subsequent content.Finally, our renewal groups according to the following formula
Number：
Wherein pejFor the packet loss of path j, MTU is MTU, and the MTU for usually assuming that all paths is one
Sample.
As shown in figure 3, the algorithm flow chart updated for group number：
1) when retransmitting, for every paths, repeat step 1-4.
2) two HEARTBEATs are sent, waits HEARTBEAT_ACK, retransmitted if time-out, until receiving two
HEARTBEAT_ACKs.The RTT times of two HEARTBEATs are obtained, selects wherein smaller value true according to formula (1) as RRTT
Determine the RTT in path.
3) bandwidth sample is extracted according to formula (2), according to formula (3) computation bandwidth, and updates BWprevious.
4) packet loss pe is obtained from transport management module.
5) according to formula (4) renewal group number N.
It is determined that after group number, blended data distribution module is marked with continuous sequence S1-SNN number of packet give
Network encoder.When network encoder will generate a coding bag, from finite field gf (28) in randomly select N number of parameter a1,
a2..., aN, form a S1-SNLinear combination coding bag T.Due to each parameter ai(1<i<N a word can) be expressed as
Section, each packet is also to be made up of a string of bytes, generates the actual addition and multiplication between byte of calculating of coding bag, if
S1-SNRegard byte vector as, then：
T=a1S1+a2S2+...+aNSN (5)
As shown in figure 4, for all of packet, either raw data packets still encode bag, we are in DATA blocks
The NC blocks of a carrying coding information are inserted before, including the scope and code coefficient of group.This NC block can inform reception
How end processes these packets.So, in this group, there is provided will reduce to total load space of user data
4th, rapid data distribution policy is mixed
The data packet re-ordering in group is avoided due to network code, so here and not needing scheduling mechanism.Needs do
Be that the maximum data volume of distribution caches and send as quickly as possible data to path.A kind of simple solution is to the greatest extent
Valid window (effective window) may be filled up.Valid window determines the data volume for a certain moment allowing to send.Road
Valid window on the i of footpath is defined as：
effwndi=min { cwndi,arwnd} (6)
Wherein cwndiFor the congestion window of path i, arwnd is the reception window notified in newest SACK.On the i of path most
Big receiving space is：
spacei=(effwndi-outstandingi)(1-pei) (7)
Wherein outstandingiThe data volume of confirmation is not received to have sent on the i of path but also.Finally, by packet point
Dispensing has the path of maximum space.Repeat to find the path with maximum space and distribute packet, until distributing one
The data of group.
As shown in figure 5, the algorithm flow chart distributed for rapid data：
1) when there are data to need transmission, the maximum receiving space of every active path is calculated according to formula (7), and chooses tool
There is the path j (the wherein maximum path of bandwidth is selected when there is multiple maximum receiving spaces) of maximum receiving space.
If 2) j is null value, certain path release caching is waited, and distribute data on the path.Otherwise, on the j of path
Distribution data.
Retransmit to ensure decodability and reducing, need to add redundant data packets.In the N number of number for distributing a group
After bag, we add some redundant data packets at the path caching end for having data distribution per bar.The generation of redundancy packet and
The generation of coding bag is identical, also contains the information of whole group.Redundant data packets have identical with packet before it
TSN, can be confirmed in SACK by repeating TSN domains.
Assume that in a group comprising N number of packet, the packet being assigned on the i of path is Mi, then it is superfluous on the i of path
Remaining should be set to：
Because data are properly received rate for 1-pe on the i of pathi, the setting of the redundancy can ensure that in independent pathway i
On can finally have MiIndividual packet reaches receiving terminal.So, there can be N number of packet to reach on all paths altogether to receive
End.Fig. 6 shows the occupancy situation in the caching of path.It may be seen that in most of the cases, on every paths only
One redundant data packets, this is because rapid data distribution algorithms can distribute more data on the relatively low path of packet loss
Bag so that redundancy is stable in minimum.
5th, transfer management mechanism is organized
Code Design according to more than, including congestion control, it is necessary retransmit and the transfer management such as path packet loss record most
Can be carried out with the unit organized well.These management are carried out all in transport management module.Definition group time-out GTO (Group Time-
Out) be first packet of the group retransmission time out RTO (Retransmission Time-Out).Define two group pointer GC
And GP.
GC represents the current group that not yet receiving end is successfully decoded, sends earliest, and this group of packet is stored in path caching
It is foremost etc. to be confirmed.GC has identical use with the outstanding packets in standard SCTP in congestion control.
If that is, SACK confirms a new TSN in GC, performing and start slowly algorithm or congestion avoidance algorithm；Such as
The loss report of fruit GC is reached more than three times, then perform Fast retransmission；If reaching GTO, the Retransmission timeout of GC is performed.Need
, it is noted that because congestion control is by a group rather than in units of independent data bag, the renewal of cwnd is added
By force, while also greatly strengthen to the tolerance of packet loss and SACK time-out.So, cwnd can rapid growth to enough values,
Re-transmission is also greatly reduced.
During generation Fast retransmission, we select to possess the most path p of outstanding packets for belonging to GC and carry out phase
Should judge.Relatively BWpAnd cwndp/RTTpBetween size judge packet loss reason：If cwndp/RTTp<BWp, show path simultaneously
There is no congestion, judge that packet loss is caused by wireless mistake, do not change cwndp；Otherwise, packet loss is attributed to congestion, is subtracted
Little cwndp：
ssthreshp=max (BWp*RTTp,cwndp/2,4*MTU) (9)
Wherein ssthreshpStart threshold value slowly for path p, it is contemplated that bandwidth, it needs to consider many factors BWp*
RTTp.The coding bag of a GC is retransmitted simultaneously.
During generation Retransmission timeout, with standard SCTP the adjustment operation of congestion window and threshold value is equally performed.Retransmit simultaneously
The number of bag is the difference between the group number N of GC and the GC number of data packets of the current confirmation of receiving end.
The packet of all re-transmissions all equally carries out network code, and possesses and last packet (S in the groupN) phase
Same No. TSN, this equally can be distinguished by the TSN domains of duplicate acknowledgment in SACK.Finally, BW is selectedq(1-peq) maximum
Path, carries out as early as possible data packet retransmission.
GP is the group of nearest decoding success before GC, and its packet discharges from caching, but it receives shape
State is still retained.GP is used to carry out the calculating of packet loss (pe).By SACK, GP can record the number for sending on each path
According to bag sum (include redundancy packet and retransmit bag) and the packet being properly received.When GC completes decoding, transfer management mould
Block collects the ratio of GP unacknowledged data bag and total data bag on every paths, as a packet loss sample, using confidence
The packet loss of interval statistics more new route.Finally, the packet loss of every paths is fed back to blended data point by transport management module
Send out module.GC and GP are respectively directed to next group, repeating algorithm.
As shown in fig. 7, for the algorithm flow chart of group transfer management：
If 1) receive SACK, otherwise execution step 2-4, execution step 5 in a GTO.
2) value of minGroup and maxGroup is initialized.
3) TSN x that are new for each in SACK or repeating, proceed as follows：Group G belonging to x is found out, G's
Group count pick up device count is counted, and the group of G loses report count device missing_report zero setting, discharges x；Update
MinGroup and maxGroup；If G is current group GC, the congestion window in the path for sending x is updated, if while the group meter of GC
Group number of the number device value more than or equal to GC, discharges the packet of all GC, updates packet loss, updates GC and GP.
4) for each group G between minGroup and maxGroup, proceed as follows：If do not had in SACK
Belong to the confirmation of G, the group of G is lost report count device and counted, if while the value of the group report count device of G is carried out quick more than 3
Retransmit.
5) for each path that time-out TSN in GC is located, Retransmission timeout is carried out.
Claims (4)
1. a kind of multidiameter delay transmission method based on network code, its step includes：
A) the network code computing based on group, using bandwidth and packet loss determination group number, is carried out to the packet in a group
Linear combination network code；Comprise the following steps that：
(1) for path i, the round-trip delay RTT in the path is determined by following formula：
Wherein, SRTTiRepresent the smooth roundtrip time delay of path i, RRTTiRepresent the reference round-trip delay of path i, a<1 and b>1 is
The boundary factor of round-trip delay RTT；
(2) the estimation measurement of bandwidth BW：
First, when a group number needs to update, according to the bandwidth sample of following formula collecting path i：
Wherein sendsizeiIt is to terminate to data is activation amount this moment, Tl from last time samplingiAnd TeiRespectively at this section
Interior last packet leaves path i cachings and first packet into the time of the caching；
Secondly, in order to eliminate fluctuation, bandwidth sample is smoothed, obtains estimated result：
Wherein T0For bandwidth smoothing factor, BWpreviousiFor a upper estimated result；
(3) measurement of packet loss pe：Packet loss pe is provided by transport management module；
(4) according to following formula renewal group number N:
Wherein, MTU represents MTU；
B) mix rapid data distribution policy, select that there is the path of maximum receiving space to carry out data distribution, often distribute one
Group data, all add certain redundant data packets at path caching end；
C) transfer management mechanism is organized, management, including congestion control, necessary re-transmission and packet loss is transmitted in units of group
Record update.
2. a kind of multidiameter delay transmission method based on network code as claimed in claim 1, it is characterised in that based on group
Network code computing, including：
A) two-way time RTT measurements：Send heartbeat packet HEARTBEAT to obtain with reference to two-way time RRTT, during contrast smooth roundtrip
Between SRTT, when RRTT and SRTT it is close when, select SRTT value as path RTT；When RRTT and SRTT gaps are larger, choosing
RRTT is selected as the RTT in path；
B) bandwidth BW is estimated：Bandwidth sample is worth to by the traffic volume of data in time of measuring interval and the ratio of time of measuring, then
It is smoothed and obtains bandwidth estimation value；
C) organize number to update：Using two-way time RTT, bandwidth BW and packet loss pe determination group numbers；
D) network code bag is generated：According to a group number division group, linear combination coding is carried out to the packet in a group, and
Corresponding encoded information is inserted in packet.
3. a kind of as claimed in claim 1 multidiameter delay transmission method based on network code, it is characterised in that the quick number of mixing
According to distribution policy, including：
A) Path selection：Select that there is the path of maximum receiving space to carry out data distribution, wherein maximum receiving space is referred to,
A certain moment path allows the data volume that send and can be successfully received；
B) redundancy is added：The packet number and packet loss being fitted on certain path according to certain component carries out redundancy calculating, adds
Plus redundant data packets, it is ensured that the data of the data packet number not less than its distribution of receiving terminal can be successfully arrived on the independent pathway
Bag number.
4. a kind of multidiameter delay transmission method based on network code as claimed in claim 1, it is characterised in that group transmission
Administrative mechanism, including：
A) congestion control based on group：For group GC for currently pointing to, GC represents that current not yet receiving end is successfully decoded, earliest
The group of transmission, if selecting to confirm that SACK confirms a new transmission serial number TSN in GC, execution starts slowly or Congestion Avoidance
Algorithm；If the loss report of GC is reached more than three times, corresponding Fast retransmission algorithm is performed according to packet loss reason；If group time-out GTO,
Then carry out the Retransmission timeout algorithm of normal stream transmission control protocol SCTP；
B) packet loss pe is calculated：For group GP for being recently completed transmission, GP is the group of nearest decoding success before GC,
Record GP by the sum for sending packet and the packet being properly received, calculates the packet loss in each path on each path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410124188.0A CN103840917B (en) | 2014-03-28 | 2014-03-28 | Multipath parallel transmission scheme based on network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410124188.0A CN103840917B (en) | 2014-03-28 | 2014-03-28 | Multipath parallel transmission scheme based on network coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103840917A CN103840917A (en) | 2014-06-04 |
| CN103840917B true CN103840917B (en) | 2017-04-26 |
Family
ID=50804095
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410124188.0A Active CN103840917B (en) | 2014-03-28 | 2014-03-28 | Multipath parallel transmission scheme based on network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103840917B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112672190A (en) * | 2020-12-22 | 2021-04-16 | 中国科学院计算技术研究所 | Minimum tariff MPQUIC data packet scheduling method and system |
Families Citing this family (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580171B (en) * | 2014-12-24 | 2018-01-12 | 北京高森明晨信息科技有限公司 | The transmission method of Transmission Control Protocol, device and system |
| CN105049369A (en) * | 2015-08-14 | 2015-11-11 | 浙江大学 | Video transmission congestion control method based on MPTCP in heterogeneous wireless network |
| CN106357453A (en) * | 2016-09-30 | 2017-01-25 | 邦彦技术股份有限公司 | System and method for bandwidth adaptive control |
| CN108667559B (en) * | 2017-03-31 | 2020-12-15 | 华为技术有限公司 | Communication method and device |
| CN107302504B (en) * | 2017-07-07 | 2020-01-14 | 北京邮电大学 | Multipath transmission scheduling method and system based on virtual sending queue |
| CN107395441A (en) * | 2017-08-31 | 2017-11-24 | 江苏省公用信息有限公司 | A kind of method for detecting Network Packet Loss situation |
| CN108075861B (en) * | 2017-09-28 | 2020-09-22 | 河北工程大学 | Multipath-based network coding transmission method in software defined FiWi network |
| CN107809662B (en) * | 2017-11-06 | 2019-08-16 | 陕西师范大学 | A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network |
| CN108111702B (en) * | 2017-12-07 | 2020-07-07 | 杭州闪目科技有限公司 | Method for automatically compensating voice packet loss of VOIP system |
| CN108173851B (en) * | 2017-12-28 | 2020-07-03 | 南京大学 | High-efficiency multimedia transmission method for spatial information network |
| CN109951260B (en) | 2018-02-12 | 2020-04-03 | 华为技术有限公司 | Data packet sending method and related equipment |
| CN110213167A (en) * | 2018-02-28 | 2019-09-06 | 吴瑞 | A kind for the treatment of method and apparatus of transmission control protocol in network congestion |
| CN110062352A (en) * | 2019-04-24 | 2019-07-26 | 重庆邮电大学 | Multipath TCP network code Transmission system and method in vehicle self-organizing network based on packet loss differentiating |
| CN110086870A (en) * | 2019-04-28 | 2019-08-02 | 北京工业大学 | The parallel method for reliable transmission of the multipath of data-oriented central site network |
| CN110198273B (en) * | 2019-05-31 | 2020-07-24 | 中南大学 | Multi-path transmission method based on network coding in data center network |
| CN110391879B (en) * | 2019-07-15 | 2020-08-18 | 湖南大学 | Packet loss recovery method and device for data transmission network and computer equipment |
| CN110503935B (en) * | 2019-07-16 | 2020-11-06 | 北京达佳互联信息技术有限公司 | Audio data processing method and device, electronic equipment and storage medium |
| CN111385062B (en) * | 2020-03-25 | 2022-05-20 | 京信网络系统股份有限公司 | Data transmission method, device, system and storage medium based on WDM |
| CN111447142B (en) * | 2020-04-08 | 2021-09-28 | 东北大学 | Parallel multi-path transmission method based on Overlay network and coding technology |
| CN112738843B (en) * | 2021-01-18 | 2022-05-27 | 哈尔滨工业大学 | High-rate 5G uplink congestion control method for determining communication delay |
| CN113490239B (en) * | 2021-07-12 | 2023-07-25 | 南京邮电大学 | Heterogeneous wireless link concurrent transmission control method based on adaptive network coding |
| CN114268936B (en) * | 2022-03-01 | 2022-07-12 | 荣耀终端有限公司 | Data transmission method and device |
| CN117119524B (en) * | 2023-10-19 | 2024-01-12 | 湖北星纪魅族科技有限公司 | Short-range data transmission method, device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101692740A (en) * | 2009-09-30 | 2010-04-07 | 西安电子科技大学 | Wireless network multi-path routing network coding transmission method |
| EP2207274A1 (en) * | 2007-11-02 | 2010-07-14 | Fujitsu Limited | Network encoding method and network encoding apparatus |
| CN102547856A (en) * | 2011-12-02 | 2012-07-04 | 湖北经济学院 | Network-coding-based multipath routing method in Ad Hoc network |
| CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
-
2014
- 2014-03-28 CN CN201410124188.0A patent/CN103840917B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2207274A1 (en) * | 2007-11-02 | 2010-07-14 | Fujitsu Limited | Network encoding method and network encoding apparatus |
| CN101692740A (en) * | 2009-09-30 | 2010-04-07 | 西安电子科技大学 | Wireless network multi-path routing network coding transmission method |
| CN102547856A (en) * | 2011-12-02 | 2012-07-04 | 湖北经济学院 | Network-coding-based multipath routing method in Ad Hoc network |
| CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
Non-Patent Citations (2)
| Title |
|---|
| Optimization Based Rate Control for Multicast with Network Coding:A Multipath Formulation;Tao Cui, Lijun Chen, and Tracey Ho;《Proceedings of the 46th IEEE Conference on Decision and Control》;20071214;第6041-6046页 * |
| 车载自组网中基于滑动窗口的网络编码传输策略;王万良等;《计算机科学》;20120930;全文 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112672190A (en) * | 2020-12-22 | 2021-04-16 | 中国科学院计算技术研究所 | Minimum tariff MPQUIC data packet scheduling method and system |
| CN112672190B (en) * | 2020-12-22 | 2023-04-25 | 中国科学院计算技术研究所 | Minimum tariff MPQUIC data packet scheduling method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103840917A (en) | 2014-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103840917B (en) | Multipath parallel transmission scheme based on network coding | |
| CN105933232B (en) | Support the Multipath Transmission control terminal and method of multi-service data transmission demand | |
| US6937600B2 (en) | Communication device and communication control method using lower layer data transmission order control at upper layer | |
| CN102577267B (en) | Communication apparatus and communication system for enhancing speed of communications between terminals | |
| RU2357379C2 (en) | Method and device for hybrid multiple-address and single-address transfer in data transfer network | |
| EP0454364B1 (en) | High speed transport protocol with two windows | |
| US7643480B2 (en) | Method and system for reliably and efficiently transporting data over a network | |
| Xu et al. | CMT-NC: improving the concurrent multipath transfer performance using network coding in wireless networks | |
| CN100534069C (en) | Accelerating method for asymmetric and multi-concurrency network | |
| CN102404077B (en) | Multi-path TCP protocol based on fountain codes | |
| CN107204834A (en) | A kind of control method of the express network transmitting based on UDT agreements | |
| CN102546106A (en) | Multipath parallel transmission method facing satellite network | |
| EP2090038A1 (en) | Method, device and software application for scheduling the transmission of data system packets | |
| CN103716136A (en) | Data transmission method and system | |
| CN103354479A (en) | LT code based spatial delay/disruption tolerant network (DTN) transmission method | |
| CN101123580A (en) | Packet transmission method and base station device | |
| CN102106176A (en) | Signal transmission method and apparatus for user equipment in mobile communication system | |
| CN102752184A (en) | Data communication system for real-time multicast service and method thereof | |
| CN100417156C (en) | A method and system for implementing data transmission in flow control transmission protocol | |
| CN101883047B (en) | Data concurrency transmission method of multi-network interface device | |
| Halepoto et al. | Scheduling over dissimilar paths using CMT-SCTP | |
| CN103825682B (en) | Efficient and rapid method for transmitting WTB multicast message data | |
| US20150117201A1 (en) | Data transmission system for networks with non-full-duplex or asymmetric transport | |
| CN101248618B (en) | Flow control transport protocol output stream queue management and data transmission processing method | |
| JP3802363B2 (en) | Method and apparatus for reducing delay time in distributing data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |