FMTCP: A Fountain Code-based Multipath Transmission Control Protocol

被引:22
作者
Cui, Yong [1 ]
Wang, Xin [2 ]
Wang, Hongyi [1 ]
Pan, Guangjin [3 ]
Wang, Yining [1 ]
机构
[1] Tsinghua Univ, Beijing 100084, Peoples R China
[2] SUNY Stony Brook, Dept Elect & Comp Engn, Stony Brook, NY USA
[3] Beijing Univ Posts & Telecommun, Beijing, Peoples R China
来源
2012 IEEE 32ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS) | 2012年
关键词
D O I
10.1109/ICDCS.2012.23
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Ideally, the throughput of a Multipath TCP (MPTCP) connection should be as high as that of multiple disjoint single-path TCP flows. In reality, the throughput of MPTCP is far lower than expected. This is fundamentally caused by the fact that a subflow with high delay and loss affects the performance of other subflows, and thus becomes the bottleneck of the MPTCP connection and significantly degrades the aggregate goodput. To tackle this problem, we propose Fountain code-based Multipath TCP (FMTCP), which effectively mitigates the negative impact of the heterogeneity of different paths. FMTCP takes advantage of the random nature of the fountain code to flexibly transmit encoded symbols from the same or different data blocks over different subflows. Moreover, we design a data allocation algorithm based on the expected packet arriving time and decoding demand to coordinate the transmissions of different subflows. Quantitative analyses are provided to show the benefit of FMTCP. We also evaluate the performance of FMTCP through ns-2 simulations and demonstrate that FMTCP can outperform IETF-MPTCP, a typical MPTCP approach, when the paths have diverse loss and delay in terms of higher total goodput, lower delay and jitter. In addition, FMTCP achieves much more stable performance under abrupt changes of path quality.
引用
收藏
页码:366 / 375
页数:10
相关论文
共 24 条
[1]  
Barre Sebastien, 2011, NETWORKING, V6640
[2]  
Becke M., 2012, P IEEE INT C COMM IC
[3]  
Chen Jiwei., 2004, P IFIP 3 ANN MEDITER, P263
[4]  
Dreibholz T., 2011, 2011 11th International Conference on Telecommunications (ConTEL 2011), P397
[5]  
Ford A., 2011, RFC6182
[6]  
Han H., 2006, IEEE ACK T NETWORKIN, V14
[7]  
Hsieh H.Y., 2002, P ACM MOBICOM
[8]  
Hsieh H.Y., 2003, P ACM MOBICOM
[9]  
Huang Y., P IEEE SECON 2008
[10]  
Hwang Y., 2010, P ACM CONEXT STUD WO