Cyclic Matrix Coding to Mitigate ACK Blocking of MPTCP in Data Center Networks

Multi-path Transmission Control Protocol (MPTCP) has shown great potential in improving network bandwidth and robustness by utilizing multiple subflows in data center networks (DCNs). However, the delay and loss heterogeneities of multiple paths potentially cause packet reordering, resulting in the...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on cloud computing Vol. 12; no. 2; pp. 419 - 430
Main Authors Li, Zhaoyi, Huang, Jiawei, Wang, Shiqi, Lyu, Wenjun, Wang, Jianxin
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.04.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Multi-path Transmission Control Protocol (MPTCP) has shown great potential in improving network bandwidth and robustness by utilizing multiple subflows in data center networks (DCNs). However, the delay and loss heterogeneities of multiple paths potentially cause packet reordering, resulting in the ACK blocking and increased latency. Recent coding-based solutions use forward error correction (FEC) to mitigate path heterogeneity with redundant encoded packets. However, current FEC-based solutions work at the subflow level, that is, each subflow independently generates redundant encoded packets. This intra-subflow coding, however, does not leverage the path diversity, easily suffering from long tail latency. In this article, we propose a new MPTCP based on cyclic matrix coding, called as CM-MPTCP, which encodes packets inter subflow to leverage the path diversity. Specifically, to let good paths help bad ones, the good paths deliver more redundant packets encoded based on cyclic matrix, which gives more coding opportunities to packets on bad paths, thus achieving high packet decoding ratio at the receiver side. The results of large-scale NS2 simulations show that CM-MPTCP effectively mitigates the ACK blocking and reduces the average flow completion time (AFCT) by about <inline-formula><tex-math notation="LaTeX">45\% \sim 70\%</tex-math> <mml:math><mml:mrow><mml:mn>45</mml:mn><mml:mo>%</mml:mo><mml:mo>∼</mml:mo><mml:mn>70</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="huang-ieq1-3366534.gif"/> </inline-formula> under a wide variety of network conditions compared with the state-of-the-art coding-based MPTCPs.
ISSN:2168-7161
2168-7161
2372-0018
DOI:10.1109/TCC.2024.3366534