CN104994036A - Dynamic data scheduling method in multi-path transfer protocol - Google Patents
Dynamic data scheduling method in multi-path transfer protocol Download PDFInfo
- Publication number
- CN104994036A CN104994036A CN201510314139.8A CN201510314139A CN104994036A CN 104994036 A CN104994036 A CN 104994036A CN 201510314139 A CN201510314139 A CN 201510314139A CN 104994036 A CN104994036 A CN 104994036A
- Authority
- CN
- China
- Prior art keywords
- path
- rtt
- data
- capacity
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
- H04L45/245—Link aggregation, e.g. trunking
Abstract
The invention discloses a dynamic data scheduling method in a multi-path transmission control protocol (MPTCP), comprising the following steps: the round-trip time RTT and the round-trip time variation RTTVAR of each path are measured; whether each path is available is judged according to the RTT and RTTVAR, the congested paths are abandoned, and the available paths are retained; the data transmission capacity of each path is estimated; and a data transmission quota is allocated for each path based on the estimated data transmission capacity and the current sending window, and a scheduler allocates transmission data according to the transmission quota. According to the scheme, the essence of a TCP Vegas algorithm is absorbed on the basis of Lowest_RTT, and improvement is made on the basis, which is equivalent to adding a congestion avoidance control function to the scheduler. The method has far-reaching significance to avoiding path congestion and enhancing the overall transmission capacity of the paths.
Description
Technical field
The present invention relates to the data dispatch technology in multipath parallel transmission, refer to the dynamic data dispatching method in a kind of multi-path transmission control protocol (MPTCP, Multi-path Transmission Control Protocol) especially.
Background technology
Along with the development of network and the communication technology is popularized, increasing network-termination device has possessed Multi net voting access capability, in the face of new business is to the improve of data transportation requirements, and the development trend simultaneously utilizing Multi net voting to carry out multipath parallel transmission to have become new.Network-termination device is by the multiple wired and wireless network of access, multi-path transmission control protocol MPTCP is utilized to carry out parallel transmission by Data dissemination to mulitpath, by integrating each available path aggregate network transport bandwidth, transfer of data validity can not only be improved, meet business demand, also will improve network resource utilization and transfer of data robustness simultaneously.But, due to internetwork difference characteristic, the network bandwidth, propagation delay time and error rate etc. all can affect efficiency and the accuracy of transfer of data, MPTCP needs transmission feature and the transmittability of considering each path when carrying out Data dissemination, data are dispatched to more transmission quality good, congestion situation is preferably on path, poor transmission, congested serious path is dispatched less and is even directly abandoned, thus ensure that the packet that transmitting terminal sends arrives object receiving terminal according to the order of sequence, reduce receiving terminal data recombination time and packet loss re-transmission loss, ensure overall data transmission performance.The data that transmitting terminal is distributed on each path are recombinated at receiving terminal needs, and then give application layer according to the order of sequence, each subpath receiving terminal has a L2 cache to carry out the data recombination in each path, simultaneously eachly be connected with a level cache and carry out global data restructuring, the path of poor transmission due to the large error rate of time delay high, the problems such as packet loss re-transmission and out of order arrival can be caused, although other path data bags arrive according to the order of sequence like this, but the restructuring on level cache still needs to wait for the packet on second-rate path, causes delivery delay.If the stand-by period is excessively of a specified duration, level cache will by other comparatively shortest path be full of, due to delay pay, transmitting terminal connects level and can not get confirming, the packet Retransmission timeout compared with shortest path will be caused, cause receiving terminal buffer memory entirety to be blocked, have a strong impact on multipath parallel transmission overall performance.Therefore, in MPTCP data dispatch, dynamically take rational scheduling strategy according to the transmission characteristic change in each path, most important for the reliable and effective multipath parallel data transmission of guarantee.
In existing MPTCP agreement, the data dispatch strategy of acquiescence is Lowest-RTT, it is a kind of simple dynamic dispatching algorithm, (RTT two-way time of path selection, Round-Trip Time) as the evaluation index of path transmission quality, characterize the propagation delay time in path, RTT is less, show that path transmission quality is higher, on the contrary poorer.For each data dispatch, the minimum path of prioritizing selection transmission delay as optimal path, when the send window (cwnd, congestion window) of optimal path is zero, select the secondary little path of propagation delay time as optimal path again, by that analogy.In addition, also has a kind of data dispatching method Round Robin of passive type, owing to not considering each path transmission difference in quality, data are distributed equably, receiving terminal data are very easily caused to arrive out of order, cause transmission blocking, performance is not high, is now only retained among kernel as research test reference.
Obvious Round Robin data dispatch strategy can not adapt to the changeable actual environment of path transmission situation, the target of multipath parallel transmission cannot be realized, and although Lowest-RTT data dispatch strategy achieves dynamic dispatching to a certain extent, but only choose minimal path propagation delay time as unique evaluation criteria, although realize comparatively simple, have ignored other path transmission characteristics such as the network bandwidth.In addition, in MPTCP, scheduler and congestion control mechanism are co-ordinations, congestion control mechanism effect can affect the scheduling performance of scheduler, and Lowest-RTT data dispatch strategy does not relate to congestion state, to cause congested when excessively scheduling occurs, congestion control mechanism will the minimizing send window cwnd of multiplicative, path data transmission rate is caused sharply to decline, path bandwidth can not be made full use of, thus overall performance is had an impact, so the expection of MPTCP multi-path transmission can not be reached completely.
Traditional data dispatching method based on RTT and passive Round Robin data dispatch strategy all can not give full play to the usefulness of MPTCP multipath parallel transmission, and actual transmissions efficiency does not reach expection and expects, thus governs the application popularization of MPTCP.
Summary of the invention
In view of this, the object of the invention is to the Smart-RTT dynamic data dispatching method proposed in a kind of MPTCP, congestion control can be taken into account, the actual transmissions ability of real-time estimation path, effectively improve scheduler efficiency and accuracy, ensure MPTCP stable transfer, improve overall transfer performance.
Based on the dynamic data dispatching method in a kind of multipath parallel transmission agreement (MPTCP) of the dynamic data dispatching method in above-mentioned purpose MPTCP provided by the invention, comprise the following steps:
Step one: the RTT and the changing value RTTVAR of two-way time two-way time measuring each path;
Step 2: judge whether path can be used, and abandons congestion path according to RTT and RTTVAR, retains available path;
Step 3: the data transmission capabilities estimating each path;
Step 4: the data transmission capabilities that integrating step three is estimated is each path allocation transfer of data quota;
Step 5: the transmission quota distribution transmission data in each path that scheduler provides according to step 4.
In some embodiments, described step 2 comprises: made comparisons by RTTVAR and threshold value RTTVART,
If RTTVAR >=RTTVART, judge the conversion trend of RTT,
If RTT value increases, judge that this path is congestion path, directly abandon,
If RTT value reduces, retain this path;
If RTTVAR < is RTTVART, retain this path.
In some embodiments, described RTTVART sets flexibly according to the parameter characteristic of transmission network and transmission characteristic.
In some embodiments, the update mode of the data transmission capabilities capacity of described step 3 is:
Judge Th (t) and the magnitude relationship of Th (t-rtt) and d (t) with α,
If d (t)≤α,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Judge α=1, make capacity=capacity+1;
If α <d (t) < is β,
Judge Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge Th (t) <Th (t-rtt), constant;
If d (t) >=β,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Wherein,
Capacity is the data transmission capabilities in path, is same dimension with send window;
D (t) is the packet number of buffer memory in the queue of t transport network path;
(α, β) is the variable of the number-of-packet of buffer memory in net control path queue, and initial value is (1,3);
Th (t) and Th (t-rtt) distinguishes the actual throughput rate in a RTT moment before delegated path t and t, and the value of Th (t) is
the value of Th (t-rtt) is
In some embodiments, in the queue of described t transport network path, the packet number of buffer memory upgrades according to following formula:
d(t)＝σ×Base
RTT；
σ is the expectation throughput rate in t path and the difference of actual throughput rate,
Wherein,
Cwnd (t) is the send window in t path;
Base
rTTthe minimum transfer time delay in path,
Real
rTTit is the actual transmissions time delay in path;
expect throughput rate;
it is actual throughput rate.
In some embodiments, the evaluation method of the transfer of data quota of described step 4 is: made comparisons by the data transmission capabilities capacity in each path and the send window cwnd in path,
If capacity < is cwnd, then scheduler is capacity to the quota in this path;
If capacity >=cwnd, then scheduler is cwnd to the quota in this path.
In some embodiments, described step 5 comprises: scheduler chooses the minimum path of RTT as optimal path, transfer of data is carried out by the allocation of quota data of step 4, after the quota in the minimum path of RTT is finished, choose RTT little path again to transmit, carry out successively, until be sent completely the total data transmission of buffer memory.
As can be seen from above, Smart-RTT dynamic data dispatching method in MPTCP provided by the invention overcomes can not adapting to the changeable actual environment of path transmission situation and not relating to the shortcoming of congestion situation of traditional Round Robin and Lowest_RTT data dispatch strategy, there is the advantage of following several respects: (1) considers the congested impact on transmission performance, according to the change of RTT value, congestion situation is tentatively judged, abandon congested serious and transmission is unstable path not only reduces the hydraulic performance decline that path difference is brought, reduce the computation complexity of follow-up function module simultaneously, (2) add path transmission ability estimation block and real-time dynamic estimation is carried out to the data transmission capabilities in path, accurately, efficiently, possess adaptive characteristic, accurately the congestion condition in reflection path.(3) scheduler is by accurately estimating the real-time Transmission ability in each path, before packet loss occurs in path, (before namely congestion mechanism works) just reduces Data dissemination quota, solve scheduler schedules blindness problem, conservative control transmission package number, avoid the congested performance sharp fall brought occurs, improve dispatching efficiency and the accuracy of scheduler, keep MPTCP stable transfer, for the overall transfer performance improving MPTCP, there is comparatively profound significance.
Accompanying drawing explanation
Fig. 1 is the flow chart of the Smart-RTT dynamic data dispatching method in MPTCP provided by the invention;
Fig. 2 is that the Smart-RTT dynamic data dispatching method in MPTCP provided by the invention realizes block diagram.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Fig. 1 is the flow chart of the Smart-RTT dynamic data dispatching method in the MPTCP that proposes of the present invention.The dynamic data dispatching method of the called after Smart-RTT that the present invention proposes comprises following step:
Step one: the RTT and the changing value RTTVAR of two-way time two-way time measuring each path;
Step 2: judge whether path can be used, and abandons congestion path according to RTT and RTTVAR, retains available path;
Step 3: the data transmission capabilities estimating each path;
Step 4: the data transmission capabilities that integrating step three is estimated is each path allocation transfer of data quota;
Step 5: the transmission quota distribution transmission data in each path that scheduler provides according to step 4.
Further, step 2 comprises: by RTTVAR and threshold value RTTVAR
tmake comparisons,
If RTTVAR>=RTTVAR
t, judge the conversion trend of RTT,
If RTT value increases, judge that this path is congestion path, directly abandon,
If RTT value reduces, retain this path;
If RTTVAR < is RTTVAR
t, retain this path.
The change RTTVAR of RTT and RTT is two important parameters of reflection current path data transmission scenarios and transmission quality.RTTVAR is less, shows that the transmission of this path data is more stable, otherwise poorer; RTT is less, shows that path transmission quality is higher, otherwise poorer.RTT continues to increase packet in explanation network and piles up, and continues to increase transfer of data bag number and will cause network congestion.The meaning of present treatment process is: the change RTTVAR according to path round-trip time RTT and path round-trip time carries out Preliminary screening to each transmission path, eliminates the path of excessive congestion, retains transmission quality and the fair path of stability as available path.Avoid that transmission is unstable, congested heavier path is to the interference of overall performance and the extra computational complexity that brings.
Further, for RTTVAR
t, can set flexibly according to the parameter characteristic of transmission network and transmission characteristic, respectively in order to show path be RTTVAR available time the upper bound.RTT value RTT above in each step and RTTVAR value RTTVAR, both can be direct measured value, also can be the further processing costs based on measured value, as smoothing processing method etc.
Further, the update mode of the data transmission capabilities capacity of described step 3 is:
If d (t)≤α,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Judge α=1, make capacity=capacity+1;
If α <d (t) < is β,
Judge Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge Th (t) <Th (t-rtt), constant;
If d (t) >=β,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Wherein, capacity is the data transmission capabilities in path; D (t) is the packet number of buffer memory in the queue of t transport network path; (α, β) is the variable of the number-of-packet of buffer memory in net control path queue, and initial value is (1,3).
Further, in the queue of t transport network path, the computing formula of packet number d (t) of buffer memory is: d (t)=σ × Base
rTT, σ is the expectation throughput rate in t path and the difference of actual throughput rate,
Wherein, cwnd (t) is the send window in t path; Base
rTTthe minimum transfer time delay in path, Real
rTTit is the actual transmissions time delay in path;
expect throughput rate;
it is actual throughput rate.
The data transmission capabilities capacity power introduced in this process has identical dimension and similar evaluation method with the send window cwnd in congestion control mechanism, that is: revise in conjunction with the send window that the propagation delay time of path reality is current to path, calculate the packet number of buffer memory in path queue, on this basis the actual data transfer ability in path is upgraded.Path data transmittability capacity is by path data transmittability estimation block by calculating d (t) value and two parameter alpha, and the relation between β dynamically adjusts.When d (t) is less than α, represent that message transmission rate is too slow, illustrate that this path bandwidth does not also make full use of, transmittability has much room for improvement, if but detect that throughput diminishes, need suitably to reduce transmittability; When d (t) is greater than β, represent that message transmission rate is too fast, path bandwidth will reach saturated, continuing to increase transmittability may cause congested, needs suitably to reduce transmittability, if but throughput rate detected still in increase, room for promotion is in addition described, need to increase transmittability, increase threshold alpha, the value of β simultaneously; If d (t) is between α, β, then illustrate that path status is stable and transfer of data maintains greater efficiency, even if throughput diminishes also without the need to changing transmittability, if but detect that throughput increases, also need to continue to increase transmittability, increase threshold alpha, the value of β simultaneously.
More than increase threshold alpha, the value of β is the bandwidth contention power in order to improve each path, to obtain maximum throughput.There is not the number-of-packet scope of buffer memory in transport network path queue under congested prerequisite in parameter alpha and β representative, α and β needs dynamically to set (acquiescence is 1 and 3) according to path transmission state, to adapt to the requirement of network condition change in real time.
Present treatment process with reference to TCP Vegas congestion control mechanism, same update mode is taken to the data transmission capabilities capacity in path, when the packet number predicting buffer memory in path is lower than α or higher than β, the data transmission capabilities in path is increased and decreased (namely increase or reduce 1) with identical amount.The present invention, by execution mode below, proposes more preferably to estimate mode to the real-time Data Transmission ability in path, obtains larger bandwidth under being beneficial to present networks square one.
Further, the dynamic estimation modular algorithm of path data transmittability is as follows:
Wherein, Th (t) is the actual throughput rate of path in t, Th (t-rtt) be t before the actual throughput rate in a RTT moment, the value of Th (t) is
the value of Th (t-rtt) is
In above-mentioned path data transmittability dynamic estimation algorithm, when the number-of-packet predicting buffer memory in path is higher than β, to the data transmission capabilities in path with
mode reduce, and when the number-of-packet of buffer memory in transport network path queue is greater than α, and the actual throughput rate in path is when still the more previous RTT moment increases, makes α and β parameter increase by 1.Present treatment mode has considered bandwidth contention factor under the prerequisite not causing network congestion, the micro-variations of the actual throughput rate in real-time judge path, with when real network is all right, keep higher bandwidth contention ability, linear minimizing transmittability value, can keep the stability of transmittability simultaneously.
Further, the evaluation method of the transfer of data quota of step 4 is: made comparisons by the data transmission capabilities capacity in each path and the send window cwnd in path,
If capacity < is cwnd, then scheduler is capacity to the quota in this path;
If capacity >=cwnd, then scheduler is cwnd to the quota in this path.
As previously mentioned, the data transmission capabilities capacity in path that the present invention proposes has identical dimension and estimation mode with the congestion window cwnd in congestion control mechanism, using the transmission quota of smaller in the two as path reality, congestion control is equivalent to introduce data scheduling strategy in advance, to compensate in Lowest-RTT data dispatch strategy only using sole criterion that RTT value is assessed as path transmission, not relating to congested process causes data excessively to be dispatched or the deficiency of delayed scheduling, the real-time Transmission ability in path is accurately estimated, just Data dissemination quota was reduced before packet loss occurs in path, thus improve body scheduler schedules efficiency and accuracy, keep MPTCP stable transfer, improve overall transfer performance.
Further, step 5 comprises: scheduler chooses the minimum path of RTT as optimal path, transfer of data is carried out by the allocation of quota data of step 4, after the quota in the minimum path of RTT is finished, choose RTT little path again to transmit, carry out successively, until be sent completely the total data transmission of buffer memory.
Here be after determining the transmission quota in each path, have employed the Data dissemination mode of the Lowest-RTT data dispatch strategy of acquiescence.
For making design of the present invention, know-why more clear, below specific embodiment of the invention is described in detail.The Smart-RTT dynamic data dispatching method that the present invention proposes, is applicable to all use MPCTP and carries out the occasion of multipath parallel data transmission, and all network-termination devices possessing Multi net voting access are all applicable.Multipath parallel transmission strategy based on dynamic data scheduling provided by the invention, its realization in MPTCP as shown in Figure 2, specifically can comprise following implementation step:
Data are passed to transport layer by socket by application layer program, and for application layer, data transmission is transparent, and transport layer conceals specific implementation details to application layer.Transport layer is divided into MPCTP upper strata and standard TCP layer, also conceals downwards realize details to network layer, for network layer, only has standard TCP layer to be visible.Transport layer MPTCP control centre receives application layer data, transfers to data dispatch module to carry out Data dissemination after carrying out data sectional.All access networks of the path selection module detection current network terminal equipment of MPTCP, select according to routing strategy the path can carrying out transfer of data, also transfer to data dispatch module to carry out optimal path selection.
Data dispatch module is MPTCP key function part, and the selection of optimal path and reasonable data Quota distribution directly affect efficiency and the reliability of multipath parallel transmission.What the present invention proposed acts synergistically based on RTT change and the scheduling strategy of path transmission capabilities and the Lowest-RTT scheduling strategy of acquiescence, jointly lifting multipath parallel transmission performance.
Particularly, for the available transmission paths used that path selection module provides, first scheduler measures propagation delay time and the situation of change thereof in each path, is represented here by RTT.Path Delay Variation being exceeded to certain limit judges, if RTT is in increase, then abandons this path, if not, then retain this path.So far complete the Preliminary screening work of optimal transmission paths, avoid that transmission is unstable, congested heavier path is to overall performance and interference and the extra computational complexity that brings.
After completing Preliminary screening, the path scheduler of reservation thinks all possess data transmission capabilities, then carries out path transmission energy force evaluating.This estimating algorithm is with reference to TCP Vegas congestion control mechanism, draw its efficient advantage to improve its deficiency simultaneously, calculate each path and do not causing the maximum transmitted ability capacity under packet loss prerequisite, then the congestion control window cwnd in capacity and each path is compared.If capacity is more than or equal to cwnd, then this path transmission quota of data is cwnd; If capacity is less than cwnd, then this path transmission quota of data is capacity.
After completing above-mentioned two steps, scheduler carries out transfer of data by utilizing Lowest-RTT scheduling strategy.Concrete, the current RTT value in the more each path of scheduler, the path selecting RTT value minimum is optimal transmission paths, by transfer of data quota transmission data.After quota is finished, still have data to be sent if send buffer memory, then select RTT value time little path to transmit again, by that analogy, until complete the total data transmission sending buffer memory.
Provided by the invention for utilizing path minimum transfer time delay to carry out dynamic data scheduling Problems existing in MPTCP, a kind of new data dispatch strategy is proposed, this strategy utilizes RTT to change the method judging path congestion level, design path data transmissions force evaluating mechanism simultaneously, the transmittability of the current selecting paths of accurate estimation, conservative control scheduler schedules, to the number-of-packet on this path, avoids data dispatching to cross mostly occurring the congested transmission upheaval problem brought.
Certain path sends data from transmitting terminal RTT, receives from the confirmation (receiving terminal receive packet after just immediately send confirmation) of receiving terminal to this datagram on the path, the time delay altogether experienced to transmitting terminal.The change of RTT can reflect the congestion situation in path in real time accurately, and RTT change is less, shows that the transmission of this path data is more stable, otherwise poorer; RTT value is less, shows that path transmission quality is higher, otherwise poorer.In addition, RTT continues to increase packet in explanation network and piles up, continue to increase transfer of data bag number and will cause network congestion, trigger congestion control mechanism, thus cause transmitting terminal send window cwnd sharply to decline, affect the stable and efficient of transfer of data, because the loss re-transmission of packet can consume the long period, and the recovery of send window cwnd also needed through the relatively long time.RTT continues to reduce to illustrate that the data cached bag in network just gradually reduces, and congestion condition is eased or eliminates, and can continue to send packet.So utilizing the changing condition of RTT as congestion signal, the congestion condition of estimated path, is simply a kind of and efficient method.
The foundation of existing MPTCP data dispatch module assignment packet is the send window cwnd in each path, and the value of send window is adjusted by congestion control mechanism.Because the congestion control mechanisms such as Cubic, Reno are based on packet loss, maximization is utilized for reaching network bandwidth resources, these mechanism infinitely can increase congestion window until there is packet loss, and the vigorous reaction that its packet loss retransmits can cause the sharply decline of transmission performance, final periodically packet loss retransmits and can produce extensive damage to the overall transfer performance of MPTCP.So MPTCP data scheduler needs the real-time Transmission ability accurately estimating each path, before packet loss occurs in path, just reduce Data dissemination quota, thus improve scheduler schedules efficiency and accuracy, keep MPTCP stable transfer, improve overall transfer performance.
Consider both effects to MPTCP scheduler usefulness above, the MPTCP dynamic scheduler design estimated in real time based on the control of RTT threshold value and path transmission ability that the present invention proposes, called after Smart-RTT.First scheduler obtains RTT value and the situation of change thereof in each path, when the excursion of RTT has exceeded threshold value RSSVAR
t, illustrate that route conditions just acute variation occurs, if detect, RTT is when increasing, and illustrates that this path is about to heavy congestion occurs, abandons this path; If RTT is when reducing, route conditions fast quick-recovery is described, scheduler is just retained.
The data transmission capabilities estimation block of the present invention's design, by adding controlling functions in MPTCP scheduler, utilizing RTT measured value and TCP Vegas algorithm flow, obtaining the transmittability of each path dynamic realtime.
Consider the send window of the real-time transmittability in each path and current path, the two is made comparisons, get the transfer of data quota of smaller as this path, after the transfer of data quota in each path is determined, scheduler is each arrangement path transfer of data according to the transfer of data quota of distributing according to Lowest RTT path transmission strategy.
Smart-RTT dynamic data dispatching method is on the basis of Lowest RTT, draw the marrow of TCP Vegas algorithm, and improve on its basis, be equivalent to add Congestion Avoidance controlling functions in MPTCP scheduler, for avoiding path congestion, the overall transfer ability improving path has far-reaching influence.
Those of ordinary skill in the field are to be understood that: the foregoing is only specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1. the dynamic data dispatching method in multipath parallel transmission agreement (MPTCP), is characterized in that, comprise the following steps:
Step one: the RTT and the changing value RTTVAR of two-way time two-way time measuring each path;
Step 2: judge whether path can be used, and abandons congestion path according to RTT and RTTVAR, retains available path;
Step 3: the data transmission capabilities estimating each path;
Step 4: the data transmission capabilities that integrating step three is estimated is each path allocation transfer of data quota;
Step 5: the transmission quota distribution transmission data in each path that scheduler provides according to step 4.
2. the dynamic data dispatching method in MPTCP according to claim 1, is characterized in that, described step 2 comprises: by RTTVAR and threshold value RTTVAR
tmake comparisons,
If RTTVAR>=RTTVAR
t, judge the conversion trend of RTT,
If RTT value increases, judge that this path is congestion path, directly abandon,
If RTT value reduces, retain this path;
If RTTVAR < is RTTVAR
t, retain this path.
3. the dynamic data dispatching method in MPTCP according to claim 2, is characterized in that, described RTTVAR
tset flexibly according to the parameter characteristic of transmission network and transmission characteristic.
4. the dynamic data dispatching method in MPTCP according to claim 1, is characterized in that, the update mode of the data transmission capabilities capacity of described step 3 is:
Judge Th (t) and the magnitude relationship of Th (t-rtt) and d (t) with α,
If d (t)≤α,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Judge α=1, make capacity=capacity+1;
If α <d (t) < is β,
Judge Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge Th (t) <Th (t-rtt), constant;
If d (t) >=β,
Judge α > 1 and Th (t) >=Th (t-rtt), make capacity=capacity+1, α=α+1, β=β+1;
Judge α > 1 and Th (t) <Th (t-rtt), order
Wherein,
Capacity is the data transmission capabilities in path, is same dimension with send window;
D (t) is the packet number of buffer memory in the queue of t transport network path;
(α, β) is the variable of the number-of-packet of buffer memory in net control path queue, and initial value is (1,3);
Th (t) and Th (t-rtt) distinguishes the actual throughput rate in a RTT moment before delegated path t and t, and the value of Th (t) is
the value of Th (t-rtt) is
5. the dynamic data dispatching method in MPTCP according to claim 4, is characterized in that, in the queue of described t transport network path, the packet number of buffer memory upgrades according to following formula:
d(t)＝σ×Base
RTT；
σ is the expectation throughput rate in t path and the difference of actual throughput rate,
Wherein,
Cwnd (t) is the send window in t path;
Base
rTTthe minimum transfer time delay in path,
Real
rTTit is the actual transmissions time delay in path;
expect throughput rate;
it is actual throughput rate.
6. the dynamic data dispatching method in MPTCP according to claim 4, is characterized in that, in described not congested prerequisite lower network, the initial value of the scope (α, β) of the number-of-packet of buffer memory is (1,3); As α <d (t) < β and Th (t) >=Th (t-rtt) or d (t) >=β, α > 1 and Th (t) >=Th (t-rtt) time adaptive increase α and β value, to improve bandwidth contention power.
7. the dynamic data dispatching method in MPTCP according to claim 4, is characterized in that, the value of described data transmission capabilities capacity is transmitted estimation block by path data and realized upgrading.
8. the dynamic data dispatching method in MPTCP according to claim 1, is characterized in that, the evaluation method of the transfer of data quota of described step 4 is: made comparisons by the data transmission capabilities capacity in each path and the send window cwnd in path,
If capacity < is cwnd, then scheduler is capacity to the quota in this path;
If capacity >=cwnd, then scheduler is cwnd to the quota in this path.
9. the dynamic data dispatching method in MPTCP according to claim 1, it is characterized in that, described step 5 comprises: scheduler chooses the minimum path of RTT as optimal path, transfer of data is carried out by the allocation of quota data of step 4, after the quota in the minimum path of RTT is finished, choose RTT little path again to transmit, carry out successively, until be sent completely the total data transmission of buffer memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510314139.8A CN104994036B (en) | 2015-06-09 | 2015-06-09 | A kind of dynamic data dispatching method in multi-path transmission protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510314139.8A CN104994036B (en) | 2015-06-09 | 2015-06-09 | A kind of dynamic data dispatching method in multi-path transmission protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104994036A true CN104994036A (en) | 2015-10-21 |
| CN104994036B CN104994036B (en) | 2018-04-24 |
Family
ID=54305791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510314139.8A Active CN104994036B (en) | 2015-06-09 | 2015-06-09 | A kind of dynamic data dispatching method in multi-path transmission protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104994036B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105610820A (en) * | 2015-12-28 | 2016-05-25 | 中国电子科技集团公司第五十四研究所 | Multipath transport control protocol (MPTCP) based congestion control method and apparatus |
| CN105978822A (en) * | 2016-07-15 | 2016-09-28 | 福州大学 | Congestion control method based on deadline sensitivity and round-trip time in data center |
| CN106385385A (en) * | 2016-09-29 | 2017-02-08 | 东软集团股份有限公司 | Resource allocation method and device |
| CN107733811A (en) * | 2017-09-18 | 2018-02-23 | 中国电子科技集团公司第五十四研究所 | A kind of method of dynamic adjustment encoding strength |
| CN108306827A (en) * | 2017-01-12 | 2018-07-20 | 华为技术有限公司 | The method and server of transmission data |
| CN108696449A (en) * | 2018-05-09 | 2018-10-23 | 清华大学 | A kind of data dispatching method and device |
| CN109167704A (en) * | 2018-08-31 | 2019-01-08 | 赛尔网络有限公司 | The transport protocol TCP+ monitoring method of space link enhancing |
| CN109981815A (en) * | 2019-03-19 | 2019-07-05 | 广州品唯软件有限公司 | Selection method, terminal, server and the system of IP address |
| CN110113142A (en) * | 2019-04-28 | 2019-08-09 | 天通畅达(深圳)科技有限公司 | The transmission method and system of carrying large-data operation are concurrently bundled based on multiple data channel |
| CN110650089A (en) * | 2019-10-24 | 2020-01-03 | 北京大学 | Intermediate device supporting multi-path aggregation communication |
| CN111131017A (en) * | 2019-11-19 | 2020-05-08 | 中国科学院计算技术研究所 | MPTCP (Multi-protocol Transmission control protocol) cross-layer optimization method and system based on multi-cellular wireless access gateway |
| CN112217725A (en) * | 2020-10-13 | 2021-01-12 | 安徽极玩云科技有限公司 | Delay optimization method based on edge calculation |
| CN112584348A (en) * | 2020-11-27 | 2021-03-30 | 一飞(海南)科技有限公司 | Unmanned aerial vehicle formation data transmission path switching method, system, medium and terminal |
| CN113300898A (en) * | 2020-04-10 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Information processing method and system and electronic equipment |
| US11271848B2 (en) | 2017-10-28 | 2022-03-08 | Huawei Technologies Co., Ltd. | Data transmission method, apparatus, and device |
| US11425785B2 (en) | 2018-08-02 | 2022-08-23 | Huawei Technologies Co., Ltd. | Network switching method, electronic device, and system on chip |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843257A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Path estimating method and device |
| CN103873479A (en) * | 2014-03-28 | 2014-06-18 | 北京邮电大学 | Parallel data transmission algorithm based on cross-layer estimation |
| CN103929369A (en) * | 2014-05-07 | 2014-07-16 | 北京邮电大学 | Multichannel transmission control mechanism based on TCP friendliness |
-
2015
- 2015-06-09 CN CN201510314139.8A patent/CN104994036B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843257A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Path estimating method and device |
| CN103873479A (en) * | 2014-03-28 | 2014-06-18 | 北京邮电大学 | Parallel data transmission algorithm based on cross-layer estimation |
| CN103929369A (en) * | 2014-05-07 | 2014-07-16 | 北京邮电大学 | Multichannel transmission control mechanism based on TCP friendliness |
Non-Patent Citations (1)
| Title |
|---|
| FAN YANG.ETC: "A Scheduler for Multipath TCP", 《IEEE》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105610820B (en) * | 2015-12-28 | 2019-03-22 | 中国电子科技集团公司第五十四研究所 | A kind of jamming control method and device based on MPTCP |
| CN105610820A (en) * | 2015-12-28 | 2016-05-25 | 中国电子科技集团公司第五十四研究所 | Multipath transport control protocol (MPTCP) based congestion control method and apparatus |
| CN105978822A (en) * | 2016-07-15 | 2016-09-28 | 福州大学 | Congestion control method based on deadline sensitivity and round-trip time in data center |
| CN106385385A (en) * | 2016-09-29 | 2017-02-08 | 东软集团股份有限公司 | Resource allocation method and device |
| CN108306827A (en) * | 2017-01-12 | 2018-07-20 | 华为技术有限公司 | The method and server of transmission data |
| CN107733811A (en) * | 2017-09-18 | 2018-02-23 | 中国电子科技集团公司第五十四研究所 | A kind of method of dynamic adjustment encoding strength |
| CN107733811B (en) * | 2017-09-18 | 2020-02-21 | 中国电子科技集团公司第五十四研究所 | Method for dynamically adjusting coding strength |
| US11271848B2 (en) | 2017-10-28 | 2022-03-08 | Huawei Technologies Co., Ltd. | Data transmission method, apparatus, and device |
| CN108696449A (en) * | 2018-05-09 | 2018-10-23 | 清华大学 | A kind of data dispatching method and device |
| CN108696449B (en) * | 2018-05-09 | 2020-10-09 | 清华大学 | Data scheduling method and device |
| US11910489B2 (en) | 2018-08-02 | 2024-02-20 | Huawei Technologies Co., Ltd. | Network switching method, electronic device, and system on chip |
| US11425785B2 (en) | 2018-08-02 | 2022-08-23 | Huawei Technologies Co., Ltd. | Network switching method, electronic device, and system on chip |
| CN109167704A (en) * | 2018-08-31 | 2019-01-08 | 赛尔网络有限公司 | The transport protocol TCP+ monitoring method of space link enhancing |
| CN109981815A (en) * | 2019-03-19 | 2019-07-05 | 广州品唯软件有限公司 | Selection method, terminal, server and the system of IP address |
| CN110113142A (en) * | 2019-04-28 | 2019-08-09 | 天通畅达(深圳)科技有限公司 | The transmission method and system of carrying large-data operation are concurrently bundled based on multiple data channel |
| CN110650089A (en) * | 2019-10-24 | 2020-01-03 | 北京大学 | Intermediate device supporting multi-path aggregation communication |
| CN111131017B (en) * | 2019-11-19 | 2021-06-29 | 中国科学院计算技术研究所 | MPTCP (Multi-protocol Transmission control protocol) cross-layer optimization method and system based on multi-cellular wireless access gateway |
| CN111131017A (en) * | 2019-11-19 | 2020-05-08 | 中国科学院计算技术研究所 | MPTCP (Multi-protocol Transmission control protocol) cross-layer optimization method and system based on multi-cellular wireless access gateway |
| CN113300898A (en) * | 2020-04-10 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Information processing method and system and electronic equipment |
| CN112217725A (en) * | 2020-10-13 | 2021-01-12 | 安徽极玩云科技有限公司 | Delay optimization method based on edge calculation |
| CN112584348A (en) * | 2020-11-27 | 2021-03-30 | 一飞(海南)科技有限公司 | Unmanned aerial vehicle formation data transmission path switching method, system, medium and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104994036B (en) | 2018-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104994036A (en) | Dynamic data scheduling method in multi-path transfer protocol | |
| CN107682886B (en) | Multi-path data transmission method | |
| US7843832B2 (en) | Dynamic bandwidth allocation apparatus and method | |
| CN101404622B (en) | Wireless internet congestion control method based on multi-path load balancing and controller thereof | |
| US6804492B2 (en) | High volume uplink in a broadband satellite communications system | |
| CN103841041B (en) | A kind of multi-stream service concurrent transmission control method and device | |
| CN102655447B (en) | A kind of transmission method of upstream data and device | |
| CN103905328A (en) | Data transmission control system and method and related equipment | |
| CN107276850B (en) | Method and system for testing and transmitting unified interface of electricity consumption information acquisition system | |
| CN105025524A (en) | A multi-path parallel-transmitted data scheduling method and a transmission control protocol | |
| CN112512018B (en) | Method for dynamically unloading tasks among cooperative vehicles based on mobile edge calculation | |
| CN104270790A (en) | Congestion control method based on equitable distribution of communication channel | |
| CN103687033B (en) | A kind of resource allocation methods and device of LTE MU mimo systems | |
| CN101540716B (en) | Service quality-based method and service quality-based device for scheduling non-guaranteed bit rate service | |
| CN106028463A (en) | Satellite-borne dynamic spectrum resource scheduling method based on service rate control | |
| CN101207570A (en) | Data transmission method, data sending rate control method and base station | |
| Lehong et al. | A survey of LoRaWAN adaptive data rate algorithms for possible optimization | |
| CN101572596B (en) | Method and device for confirming and dispatching priority of non-ensured bit rate service | |
| CN101489267B (en) | Accommodation control method and apparatus | |
| US7733777B1 (en) | Adaptive rate allocation for multiple TCP sources in wireless networks | |
| CN105764091A (en) | Method of effectively utilizing wireless bandwidth | |
| EP2482501B1 (en) | Pipeline network device and related data transmission method | |
| US20070218916A1 (en) | Method and system for resource allocation based on distributed scheduling in a wireless comunication system including heterogeneous mobile stations | |
| CN1859064A (en) | Method for distributing channel resources | |
| CN112867163B (en) | Air interface resource scheduling method and device, computer equipment and storage medium |
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 |