CN101895466B - Method for reducing influence of data packet disorder on SCTP multipath transmission - Google Patents
Method for reducing influence of data packet disorder on SCTP multipath transmission Download PDFInfo
- Publication number
- CN101895466B CN101895466B CN 201010224001 CN201010224001A CN101895466B CN 101895466 B CN101895466 B CN 101895466B CN 201010224001 CN201010224001 CN 201010224001 CN 201010224001 A CN201010224001 A CN 201010224001A CN 101895466 B CN101895466 B CN 101895466B
- Authority
- CN
- China
- Prior art keywords
- path
- packet
- paths
- ack
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for reducing an influence of data packet disorder on stream control transmission protocol (SCTP) multipath transmission. The method comprises the following steps of: (1) acquiring metric values of paths according to the path bandwidth, the delay and the packet loss ratio, measured in real time, of each independent path; and performing path scheduling and data packet distribution according to the metric values; and (2) judging a path which loses a data packet by using a transmitting terminal through an SACK block transmitted by a receiving terminal and carrying out end-to-end path-based data packet rapid transmission. The method can effectively reduce the influence of the data packet disorder on the SCTP multipath transmission, and can improve the performance of SCTP-based end-to-end multipath.
Description
Technical field
The present invention relates to the network communications technology field, be specifically related to a kind of method of the SCTP of reduction multi-path transmission data packet disorder impact.
Background technology
Along with the development of network technology, on the one hand constantly variation of network access technique comprises wide area network, local area network (LAN) and individual territory net access technology, and is wired all constantly ripe and commercial with wireless access technology, xDSL for example, xPON, 3G, WLAN, WiMAX, Bluetooth etc.; On the other hand, the cost of access device constantly reduces, and increasing terminal begins to dispose the multiple network adapter, and for example portable terminal laptop is furnished with LAN interface and WLAN interface usually, also can support the 3G wireless access; And general PDA supports WLAN and 3G access; Some fixed terminals are also supported LAN and WLAN access simultaneously.Therefore, the principal character that is becoming Next Generation Internet based on multi-home terminal and the end-to-end multi-path transmission technology of multiple access technology.
Than the single path transmission, end-to-end multipath is the bandwidth of polymerization mulitpath effectively, thereby ensures for the user provides better QoS; Owing to use many end to end paths simultaneously, the individual paths failure can service impacting continuity, thereby provides network layer redundant for end node; Mulitpath uses simultaneously, can be adjusted at dynamically according to the congestion condition in the network transmission rate in different paths, thereby is implemented in the load balancing at network edge place; All application datas all from the mulitpath transmission, are smelt spy to the monitoring of arbitrary individual paths and can't effectively be recovered initial digital content, have better fail safe.
But, because TCP and UDP can only use an end-to-end path, can't take full advantage of the advantage of end-to-end multipath; Although SCTP supports transmitting data packets on variable paths, only incite somebody to action the main transmission path of paths conduct wherein, other are as retransmitting the path, and its characteristic can not satisfy the demand of end-to-end multipath fully.Can be so that standard SCTP supports mulitpath parallel transmission data after SCTP expanded, but the data packet disorder that the bandwidth delay variation in different paths causes can cause the performance of SCTP multipath sharply to descend, even does not reach the performance when using arbitrary single path.The quick re-transmission of SCTP is based on end-to-end single path and produces, out of order very difficult generation under this background, therefore quick re-transmission is the quick response to packet loss, and under the end-to-end multipath condition, because path difference, out of order being easy to occurs, and SCTP is misunderstood to be packet loss with it and then causes that congestion window reduces, and causes hydraulic performance decline.Therefore, on the one hand the use of end-to-end multipath so that data packet disorder arrives the situation of receiving terminal occurs in a large number; On the other hand, the SCTP self mechanism need to be made improvement tackling Shortcomings on the out of order problem.
Summary of the invention
In view of this, main purpose of the present invention is to provide the method for data packet disorder impact in a kind of SCTP of reduction multi-path transmission, and then improves the performance of SCTP multipath, reaches the purpose of polymerization mulitpath bandwidth.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of method that reduces the impact of SCTP multi-path transmission data packet disorder comprises: path bandwidth, time delay and the packet loss that (1) is measured in real time according to each independent pathway obtains the metric in this path and carries out path scheduling and packet delivery with this; (2) transmitting terminal is also implemented to retransmit fast based on the packet of end-to-end path by the path of the SACK piece judgement lost data packets of receiving terminal transmission.
Preferably, described each independent pathway is taked the Weight Round Robin packet distribution, and according to each bar end-to-end path weights with the packet delivery in the transmit queue in each bar end-to-end path.
Preferably, when described packet is distributed, if the congestion window in path then fills up congestion window less than its quantity of should giving out a contract for a project; If the path congestion window is 0, then jumps to next paths and send; Finish transmit queue and still have data if one takes turns scheduling, then carry out the next round scheduling and send.
Preferably, the packet of described each independent pathway distribution has independent transmission sequence number and the path order sequence number corresponding with this path.
Preferably, described SACK piece comprises the cum_ack piece of all receiving data and exists the gap ack piece of not receiving data.
Preferably, after receiving terminal was received packet, the delay 200ms time sent the SACK piece again; And described SACK piece transmit path correspondence is the arrival path of the data transfer sequence number of last gap ack piece affirmation wherein.
Preferably, when particular data packet not occurring three times in the gap ack piece of not receiving data, then need this packet is retransmitted; And transmitting terminal is by the path of the path order sequence number judgement packet loss of this packet, thus quick data retransmission.
Preferably, after receiving terminal receives packet, judge at first whether the value of the cum_ack of SACK piece increases, if increase, then travel through the new transmission sequence number value that is identified, and with corresponding path order sequence number relatively, upgrade the path_min_ack value of every paths;
If cum_ack does not increase, then travel through the gap ack piece in the SACK piece, if path order sequence number corresponding to transmission sequence number that gapack confirms is the path_min_ack+1 of its respective paths, then path_min_ack is made as path_min_ack+1;
If this path congestion control is in slow start stage, then this path congestion window cwnd=cwnd+1;
As be in congestion avoidance phase, then this path cwnd=cwnd+1/cwnd;
If path order sequence number corresponding to the transmission sequence number that gap ack confirms is greater than the path_min_ack+1 of its respective paths, then the transfer of data sequence number packet loss counting that path_min_ack+1 is corresponding adds one, if this path congestion window allows, then send new packet.
Preferably, when packet retransmitted fast, the path congestion window was reduced to its original half, and Slow start threshold is reduced to half of initial value, and the respective path metric was made as 2 times of initial value.
Preferably, when packet retransmitted fast, data packet retransmission adopted the path of weights maximum to transmit, and the source-destination address of retransmission data packet may remains unchanged.
The present invention effectively reduces the out of order impact on the SCTP multi-path transmission of factor data bag, has promoted the performance based on the end-to-end multipath of SCTP.
Description of drawings
Fig. 1 is the end-to-end multipath parallel transmission of SCTP schematic diagram;
Fig. 2 is that SCTP multipath receiving terminal is to the handling process of SACK piece;
Fig. 3 is the end-to-end multi-path data transmission flow of SCTP;
Fig. 4 is SCTP transfer sequence and path sequence mapping relations figure.
Embodiment
Core of the present invention is: the time delay bandwidth packet loss characteristic generation pass metric according to the path, makes it to arrive according to the order of sequence at receiving terminal as far as possible reasonably in different paths packet distribution according to metric; Form real-time end-to-end path bandwidth measurement mechanism; Form improved quick functions of retransmission, reduce the unnecessary quick re-transmission that causes because multipath is out of order; Form the new time-out time computational methods based on the path.
Method of the present invention comprises: path bandwidth, time delay and the packet loss that (1) is measured in real time according to each independent pathway obtains the metric in this path and carries out path scheduling and packet delivery with this; (2) transmitting terminal is judged the path of lost data packets by the SACK piece of receiving terminal transmission and is retransmitted fast at the packet of above-mentioned path implement based on end-to-end path.
The below is described in detail the method:
At first, transmitting terminal is that the packet that sends on every paths is kept a serial number, and this serial number is corresponding one by one with the transmission sequence number TSN of SCTP, and every paths is kept a minimum affirmation sequence number record path_min_ack simultaneously.And, before sending packet, be the selected transmit path of packet according to dispatching algorithm, if the RTT timer in this path is not opened, then enable the RTT timer in this path.
For so that packet can arrive receiving terminal according to the order of sequence, the transmitting terminal of packet need to carry out the path scheduling according to the characteristic of every paths, so that arrive as far as possible according to the order of sequence receiving terminal behind the Packet Generation, reduces out of order generation.In order to reach this effect, path bandwidth, time delay and the packet loss that we measure in real time according to each independent pathway obtains the metric in this path and carries out path scheduling and packet distribution with this.
The concrete grammar of dispatching according to path characteristics for packet comprises as follows:
The every paths of C1 is recorded in the quantity that is identified bag in the RTT measuring process of path, and with the quantity of the bag that records and the estimated value of the current available bandwidth of RTT Time Calculation, computational methods are B
i=m
i/ RTT
i, the estimated bandwidth value is
B
k＝α*B
i+(1-α)*B
k-1
The every paths basis of C2 packet loss record separately and the quantity of transmission packet are calculated packet loss P separately;
The every paths of C3 is according to the RTT that independent measurement arrives, and the estimated bandwidth that calculates and packet loss calculate the transmission metric of every paths, and this value calculating method is as follows:
metric＝10
7/B+RTT/10+P*10
6
Wherein bandwidth unit is Kbits, and delay time unit is μ s, and packet loss is percentage.After the SCTP initial association was set up, the B value that is initially set in all paths was 100000000kbps, and RTT is 100000 μ s, and P is 0;
The metric value that C4 calculates according to every paths is calculated the metric ratio of each paths as the weights of path scheduling, and the weights that the path that wherein metric is larger obtains are less; According to the weights of every paths, transmitting terminal is being carried out Weight Round Robin algorithm (Weighted Round Robin) packet distribution between each path between the path.If the congestion window in path then fills up congestion window less than its quantity of should giving out a contract for a project; If the path congestion window is 0, then jumps to next paths and send; Finish transmit queue and still have data if one takes turns scheduling, then carry out the next round scheduling and send.
Then, after transmitting terminal received the SACK piece, according to the fast operation such as re-transmission and congestion window growth of sequence number independent judgment of every paths, concrete operation method was as follows:
The D1 receiving terminal judges whether the value of the cum_ack of SACK piece increases, if increase, then travels through the new TSN value that is identified, and with corresponding path sequence comparison, upgrade the path_min_ack value of every paths.If cum_ack does not increase, then carry out D2;
Gap ack piece in the D2 traversal SACK piece if path sequence corresponding to the TSN that gap ack confirms number is the path_min_ack+1 of its respective paths, then is made as path_min_ack+1 with path_min_ack.If the control of this path congestion is in slow start stage, this path congestion window cwnd=cwnd+1 then, as be in congestion avoidance phase, then this path cwnd=cwnd+1/cwnd.If path sequence corresponding to the TSN that gap ack confirms number is greater than the path_min_ack+1 of its respective paths, then the TSN packet loss counting that path_min_ack+1 is corresponding adds one, if this path congestion window allows, then sends new packet;
D3 counts when the packet loss of corresponding TSN on its transmit path and reaches 3, then retransmit fast this packet, simultaneously respective path congestion window cwnd is reduced to its original half, Slow start threshold ssthresh is reduced to half of initial value, and its metric value is made as 2 times of initial value.Retransmit fast and adopt the path of current weight maximum to transmit, the source-destination address of retransmission data packet may remains unchanged.
In addition, after receiving terminal receives out of order packet, need not whenever to receive a packet and just send a SACK piece to transmitting terminal, but postpone to send again the SACK piece after a period of time, set the time of delay here as required, also can set initial steady state value 200ms.SACK transmit path correspondence is the arrival path of the TSN of the data of last gap ack affirmation wherein.
In addition, under this kind transmission means, every paths independently calculates the overtime re-transmission time RTO of every paths according to the RTT that measures.If this paths enters the overtime re-transmission stage, then the metric value with this path is made as original 2 times.The packet of overtime re-transmission adopts the path of metric minimum to retransmit, and the source-destination address of retransmission data packet may is constant.
Fig. 1 is the end-to-end multipath parallel transmission of SCTP schematic diagram; Fig. 2 is that SCTP multipath receiving terminal is to the handling process of SACK piece; Fig. 3 is the end-to-end multi-path data transmission flow of SCTP, and we then are described: as shown in Figure 1 for using the schematic diagram directly perceived of the end-to-end multi-path transmission of SCTP.Wherein host A disposes three network insertion cards, and host B disposes two network insertion cards, and every access card can adopt the access way of isomorphism, also can adopt the access way of isomery.
The below simply describes end-to-end multipath workflow and details based on SCTP:
When end host A wishes to communicate by letter with the opposite end host B, initiate the related request INIT piece of setting up of SCTP by host A, and carry self operable address information, after the opposite end host B is received request, return an INITACK to host A, carry equally the operable address information of host B, set up mode according to the connection of standard SCTP, host A is set up related with host B.
Because all parameters are all identical in the initial setting up of network interface unit, so host A sends packet according to the setting of every paths congestion window to every paths.After every paths had transfer of data, SCTP namely entered the operator scheme of end-to-end multipath, and every paths is carried out relatively independent congestion control and data transmitting mechanisms, and chronograph mechanism.And terminal is at related aspect execution route scheduling mechanism, arrives the out of order less as far as possible of receiving terminal experienced the path of different qualities in the hope of the packet that different network interfaces is sent after.
After entering the end-to-end multi-path transmission of the SCTP stage, the bandwidth that every paths basis measures, time delay, the property calculation such as packet loss obtain path metric value metric, and generate the weights in affiliated path according to the value of metric.When the Stream Control Transmission Protocol stack calls the transmission function, then according to routine weight value, be weighted polling dispatching to sending data queue.If related controll block formation non-NULL, the destination address of then setting according to controll block selects respective paths to send data; If related retransmission queue non-NULL, then the destination address according to each data block sends in its respective paths; If related data transmit queue is empty, then skip the transmission function, otherwise, carry out WRR algorithm distributing data according to each routine weight value.See accompanying drawing 2 about the flow process that the SCTP multipath sends.
After host A is received the SACK piece that host B returns, judge at first whether related cum_ack increases, if increase, then check the transmission sequence number TSN that all are confirmed by cun_ack, and number upgrade the path_min_ack of every paths according to its corresponding path sequence.If cum_ack does not increase, then check gap ack piece, check by path sequence corresponding to the TSN of gap ack number, and upgrade the path_min_ack of respective path.About the end-to-end multipath of SCTP the handling process of SACK piece is seen accompanying drawing 3, see Fig. 4 about the mapping relations of the end-to-end multi-path transmission sequence number of SCTP and path sequence.
As shown in Figure 4, the dotted line frame is path sequence number, and solid box is transmission sequence number.At first, first sack piece is confirmed data block 11 and 14, shows that 11 and 14 receive, second sack confirmed 11,14 and 15, show that 11,14 and 15 receive, the 3rd shows that 11,14,15,16 receive, such three sack show that equally 12 and 13 do not receive, when three such sack arrival transmitting terminals, according to standard sctp algorithm, transmitting terminal will retransmit 12 and 13.Take 11:14-16 as example, 11 expression cum_ack represent that its earlier data receives that all 14-16 represents gap ack, represent that these data blocks receive, but there are unreceived data front and back.
If receive that the SACK process is judged so that certain paths occurs to retransmit fast, the congestion window that then reduces this path arrives half of initial value, increases simultaneously path metric value and is 2 times of initial value, to reduce data packet dispatching to this paths.
Host B receives the packet that host A sends over, no matter whether out of order its arrival be, all postpone 200ms and sends the SACK piece again.The reverse path that last TSN that confirms among the Path selection SACK that sends sends.
Above flow process is the concise and to the point flow process that an end-to-end multi-path transmission based on SCTP reduces out of order impact.
Above the flow process end-to-end multipath of a kind of simple realization SCTP that is based on accompanying drawing 1 reduce the flow process of out of order arrival.Because the assault of the situation such as various congested, the shake in the real network, packet loss and forgery attack, the process that the end-to-end multipath of SCTP reduces out of order arrival is more complicated than top description possibly, but also within the scope that content of the present invention comprises.
The above; only be the better embodiment of the present invention, but protection scope of the present invention is not limited to this, any those skilled in the art is in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (4)
1. one kind is reduced the method that SCTP multi-path transmission data packet disorder affects, and the method comprises:
(1) path bandwidth, time delay and the packet loss of measuring in real time according to each independent pathway obtains the metric in this path and carries out path scheduling and packet delivery with this; The concrete grammar of dispatching according to path characteristics for packet comprises as follows:
C1) every paths is recorded in the quantity that is identified bag in the RTT measuring process of path, and with the quantity of the bag that records and the estimated value of the current available bandwidth of RTT Time Calculation, computational methods are B
i=m
i/ RTT
i, the estimated bandwidth value is
B
k＝α*B
i+(1-α)*B
k-1，
C2) every paths basis packet loss record separately and the quantity of transmission packet are calculated packet loss P separately;
C3) every paths is according to the RTT that independent measurement arrives, and the estimated bandwidth that calculates and packet loss calculate the transmission metric of every paths, and this value calculating method is as follows:
metric＝10
7/B+RTT/10+P*10
6
Wherein, bandwidth unit is kbps, and delay time unit is μ s, and packet loss is percentage; After the SCTP initial association was set up, the B value that is initially set in all paths was 100000000kbps, and RTT is 100000 μ s, and P is 0;
C4) the metric value of calculating according to every paths is calculated the metric ratio of each paths as the weights of path scheduling, and the weights that the path that wherein metric is larger obtains are less; According to the weights of every paths, transmitting terminal is carrying out Weight Round Robin algorithm packet distribution between each path between the path, if the congestion window in path then fills up congestion window less than its quantity of should giving out a contract for a project; If the path congestion window is 0, then jumps to next paths and send; Finish transmit queue and still have data if one takes turns scheduling, then carry out the next round scheduling and send,
Wherein, B represents the estimated value of bandwidth, and P represents packet loss, and metric represents the transmission metric of every paths,
(2) transmitting terminal is also implemented to retransmit fast based on the packet of end-to-end path by the path of the SACK piece judgement lost data packets of receiving terminal transmission, and after receiving terminal was received packet, the delay 200ms time sent the SACK piece again; And described SACK piece transmit path correspondence is the arrival path of the data transfer sequence number confirmed of last gap ack piece wherein, when particular data packet not occurring three times in the gapack piece of not receiving data, then needs this packet is retransmitted; And transmitting terminal is by the path of the path order sequence number judgement packet loss of this packet, thus quick data retransmission,
Transmitting terminal is that the packet that sends on every paths is kept a path order sequence number, and this path order sequence number is corresponding one by one with the transmission sequence number TSN of SCTP, and simultaneously, every paths is kept a minimum affirmation sequence number record path_min_ack,
It is characterized in that,
Described SACK piece comprises the cum_ack piece of all receiving data and exists the gap ack piece of not receiving data,
After host A is received the SACK piece that host B returns, whether the value of at first judging the cum_ack of SACK piece increases, if increase, then check the transmission sequence number TSN that all are confirmed by cum_ack, and according to the path_min_ack of its corresponding every paths of path order sequence number update;
If cum_ack does not increase, then travel through the gap ack piece in the SACK piece, if path order sequence number corresponding to transmission sequence number that gap ack confirms is the path_min_ack+1 of its respective paths, then path_min_ack is made as path_min_ack+1;
If this path congestion control is in slow start stage, then this path congestion window cwnd=cwnd+1;
As be in congestion avoidance phase, then this path cwnd=cwnd+1/cwnd;
If path order sequence number corresponding to the transmission sequence number that gap ack confirms is greater than the path_min_ack+1 of its respective paths, then the transfer of data sequence number packet loss counting that path_min_ack+1 is corresponding adds one, if this path congestion window allows, then send new packet.
2. the method for reduction SCTP multi-path transmission data packet disorder according to claim 1 impact is characterized in that the packet of described each independent pathway distribution has independent transmission sequence number.
3. the method for reduction according to claim 1 SCTP multi-path transmission data packet disorder impact, it is characterized in that, when packet retransmits fast, the path congestion window is reduced to its original half, Slow start threshold is reduced to half of initial value, and the respective path metric is made as 2 times of initial value.
4. the method for reduction according to claim 1 SCTP multi-path transmission data packet disorder impact, it is characterized in that, when packet retransmitted fast, data packet retransmission adopted the path of weights maximum to transmit, and the source-destination address of retransmission data packet may remains unchanged.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010224001 CN101895466B (en) | 2010-07-02 | 2010-07-02 | Method for reducing influence of data packet disorder on SCTP multipath transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010224001 CN101895466B (en) | 2010-07-02 | 2010-07-02 | Method for reducing influence of data packet disorder on SCTP multipath transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101895466A CN101895466A (en) | 2010-11-24 |
| CN101895466B true CN101895466B (en) | 2013-03-20 |
Family
ID=43104539
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010224001 Expired - Fee Related CN101895466B (en) | 2010-07-02 | 2010-07-02 | Method for reducing influence of data packet disorder on SCTP multipath transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101895466B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103298053A (en) * | 2013-05-23 | 2013-09-11 | 西安交通大学 | Overlay network Relay selecting method based on multisource AS (autonomous system) maximum connectivity |
Families Citing this family (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102111330A (en) * | 2010-12-15 | 2011-06-29 | 北京佳讯飞鸿电气股份有限公司 | Data transmission method of two-channel video monitoring system |
| CN102761470B (en) * | 2011-04-29 | 2015-04-08 | 清华大学 | Multipath TCP (transmission control protocol) message scheduling method |
| CN102185771B (en) * | 2011-05-05 | 2013-09-04 | 清华大学 | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) |
| CN102394858A (en) * | 2011-06-30 | 2012-03-28 | 北京邮电大学 | Method and device for transmitting information |
| WO2012109848A1 (en) * | 2011-07-28 | 2012-08-23 | 华为技术有限公司 | Signalling retransmission method, device and system based on stream control transmission protocol |
| CN102769520B (en) * | 2012-07-17 | 2015-01-28 | 西安电子科技大学 | Wireless network congestion control method based on stream control transmission protocol (SCTP) |
| CN102821048B (en) * | 2012-08-09 | 2014-10-08 | 华北电力大学 | SCTP (Stream Control Transmission Protocol) path selection method |
| CN103326831A (en) * | 2013-06-04 | 2013-09-25 | 华为终端有限公司 | Link processing method and mobile terminal in multichannel transmission control protocol |
| CN103346963A (en) * | 2013-06-26 | 2013-10-09 | 南京昭视畅网络科技有限公司 | MPTCP data scheduling method based on forecast arrival time |
| CN103501209B (en) * | 2013-09-25 | 2017-04-19 | 中国科学院声学研究所 | Heterogeneous multi-network cooperative transmission single service flow division method and equipment |
| CN103841043B (en) * | 2014-03-28 | 2017-04-26 | 北京邮电大学 | Parallel data transmission window mechanism based on friendliness |
| CN104023408B (en) * | 2014-06-26 | 2017-10-10 | 北京邮电大学 | Scheduler and its data dispatching method based on network multipath footpath parallel transmission |
| WO2017000117A1 (en) * | 2015-06-29 | 2017-01-05 | 华为技术有限公司 | Method for data processing and receiver device |
| CN104954206B (en) * | 2015-07-31 | 2018-03-30 | 重庆邮电大学 | A kind of out of order analysis method of multipath parallel transmission system |
| CN105187277A (en) * | 2015-09-14 | 2015-12-23 | 江西师范大学 | SACK loss detection and quick retransmission method based on wireless network error perception |
| CN105450536B (en) * | 2015-11-12 | 2018-12-18 | 北京交通大学 | A kind of method and apparatus of data distribution |
| CN105933232B (en) * | 2016-03-29 | 2018-10-23 | 东北大学 | Support the Multipath Transmission control terminal and method of multi-service data transmission demand |
| FR3053196A1 (en) * | 2016-06-24 | 2017-12-29 | Orange | METHOD FOR UDP COMMUNICATION VIA MULTIPLE PATHS BETWEEN TWO TERMINALS |
| CN107864084B (en) * | 2016-09-22 | 2019-06-21 | 腾讯科技（深圳）有限公司 | The transmission method and device of data packet |
| WO2018054171A1 (en) | 2016-09-22 | 2018-03-29 | 腾讯科技（深圳）有限公司 | Calling method and device, computer storage medium, and terminal |
| CN108540380B (en) | 2017-03-02 | 2021-08-20 | 华为技术有限公司 | Multi-sub-stream network transmission method and device |
| EP3582455B1 (en) * | 2017-03-02 | 2022-06-22 | Huawei Technologies Co., Ltd. | Method and apparatus for multiple subflows network transmission |
| CN109729007B (en) * | 2017-10-28 | 2022-07-22 | 华为技术有限公司 | Method, device and equipment for transmitting data |
| CN109781117B (en) * | 2017-11-15 | 2020-03-31 | 百度在线网络技术（北京）有限公司 | Combined positioning method and system |
| CN110138629A (en) * | 2018-02-02 | 2019-08-16 | 中兴通讯股份有限公司 | Detection method and device, storage medium and the processor of packet loss of link |
| CN110298001B (en) * | 2019-05-30 | 2021-11-09 | 北京奇艺世纪科技有限公司 | Method and device for acquiring log data packet and computer readable storage medium |
| CN110662256B (en) * | 2019-09-18 | 2021-03-23 | 北京交通大学 | Multi-path cross-protocol transmission data packet scheduling method and system |
| CN110635988B (en) * | 2019-10-24 | 2020-10-27 | 北京大学 | Data forwarding method and equipment for multipath transmission |
| CN111800311B (en) * | 2020-06-22 | 2021-10-08 | 中科边缘智慧信息科技（苏州）有限公司 | Real-time sensing method for decentralized computing state |
| CN112422421B (en) * | 2020-11-23 | 2022-02-22 | 北京交通大学 | Multi-path data packet transmission method of heterogeneous network |
| CN117478615B (en) * | 2023-12-28 | 2024-02-27 | 贵州大学 | Reliable transmission method in deterministic network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101510816A (en) * | 2009-03-05 | 2009-08-19 | 北京交通大学 | Multi-route parallel transmission method based on route relationship |
| CN101515840A (en) * | 2009-03-09 | 2009-08-26 | 北京交通大学 | Route selecting method of multipath parallel transmission and delivery |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8306039B2 (en) * | 2008-12-15 | 2012-11-06 | Ciena Corporation | Methods and systems for automatic transport path selection for multi-homed entities in stream control transmission protocol |
-
2010
- 2010-07-02 CN CN 201010224001 patent/CN101895466B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101510816A (en) * | 2009-03-05 | 2009-08-19 | 北京交通大学 | Multi-route parallel transmission method based on route relationship |
| CN101515840A (en) * | 2009-03-09 | 2009-08-26 | 北京交通大学 | Route selecting method of multipath parallel transmission and delivery |
Non-Patent Citations (1)
| Title |
|---|
| 李兰英等.基于流控制传输协议多宿特性研究与仿真.《电脑学习》.2008,(第2期),6-7. * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103298053A (en) * | 2013-05-23 | 2013-09-11 | 西安交通大学 | Overlay network Relay selecting method based on multisource AS (autonomous system) maximum connectivity |
| CN103298053B (en) * | 2013-05-23 | 2016-03-30 | 西安交通大学 | Based on the nerve of a covering Relay system of selection of the largest connected degree of multi-source AS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101895466A (en) | 2010-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101895466B (en) | Method for reducing influence of data packet disorder on SCTP multipath transmission | |
| US7643427B2 (en) | Multipath routing architecture for large data transfers | |
| US7136353B2 (en) | Quality of service management for multiple connections within a network communication system | |
| CN102739515B (en) | TCP congestion control for heterogeneous networks | |
| JP4632874B2 (en) | Communication terminal | |
| Hsieh et al. | pTCP: An end-to-end transport layer protocol for striped connections | |
| CN103999409B (en) | Method for link buffer size and queue length estimation for bandwidth-varying mobile data networks | |
| CN106160953B (en) | A kind of transmission method based on learning-oriented energy efficiency model | |
| CN103457871B (en) | Based on the increasing window method of the congestion avoidance phase of deferred constraint in DCN | |
| US20220294727A1 (en) | Systems and methods for managing data packet communications | |
| Ni et al. | Fine-grained forward prediction based dynamic packet scheduling mechanism for multipath TCP in lossy networks | |
| KR20060100512A (en) | Method and system for estimating average bandwidth in a communication network based on transmission control protocol | |
| CN102801606A (en) | Automatic switching method for SCTP (stream control transmission protocol) main path | |
| CN103873479A (en) | Parallel data transmission algorithm based on cross-layer estimation | |
| CN103647722A (en) | Reputation-based link congestion control method | |
| CN102790913A (en) | Audio/video transmission method on basis of 3G network | |
| Kim et al. | Improvement of MPTCP Performance in heterogeneous network using packet scheduling mechanism | |
| CN109450606A (en) | Data transmit management-control method and device | |
| Jiang et al. | Adaptive low-priority congestion control for high bandwidth-delay product and wireless networks | |
| Sup et al. | Explicit non-congestion notification: A new AQM approach for TCP networks | |
| Khalili et al. | Non-pareto optimality of mptcp: Performance issues and a possible solution | |
| CN107302504B (en) | Multipath transmission scheduling method and system based on virtual sending queue | |
| CN100382476C (en) | Method for estimating transmission delay of wireless interface for non-real operation in wireless communication | |
| EP2833589A1 (en) | Intermediate node, an end node, and method for avoiding latency in a packet-switched network | |
| Shailendra et al. | MPSCTP: A multipath variant of SCTP and its performance comparison with other multipath protocols |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130320 Termination date: 20130702 |