An Odd Couple: Loss-Based Congestion Control and Minimum RTT Scheduling in MPTCP

Lübben, Ralf; Morgenroth, Johannes

doi:10.1109/lcn44214.2019.8990831

Cited by 16 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The induced packet losses in Scenario #1 caused LIA to slow down the sending rate. Moreover, the aggressive fairness algorithm of LIA caused the throughput being suppressed further and resulted in poor performance [11]. The same cause applied to OLIA and BALIA as well.…”

Section: A Experimental Setupmentioning

confidence: 94%

“…This indicated that C-MPBBR and other BBR-based MPTCP variants could efficiently utilize and share the underlying network, in contrast with LIA, OLIA, and BALIA. According to [11], we consider the cause to be an aggressive fairness ensuring mechanism used in LIA, OLIA, and BALIA. This article has been accepted for publication in a future issue of this journal, but has not been fully edited.…”

Section: A Experimental Setupmentioning

confidence: 99%

“…Several MPTCP CC algorithms (CCAs), such as LIA [6], OLIA [7], BALIA [8], D-LIA [9], and Couple+ [10], have been proposed to address the fundamental challenges. However, they mainly focus on the second goal, which leads to the incapability of satisfying the first goal in most scenarios [11]. Moreover, their strategies mainly rely on modifying the legacy CCA in TCP (for example, Reno [12]) to fit MPTCP.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

et al. 2020

View full text Add to dashboard Cite

Multipath transmission control protocol (MPTCP) is a promising transport layer protocol that enables a device to utilize multiple communication interfaces simultaneously, thereby achieving high throughput. A congestion control algorithm (CCA) employed in MPTCP constitutes a key part that controls the data flow through different subflows (SFs). There are two fundamental challenges associated with MPTCP CCAs. First, MPTCP flows should have an advantage over single-path flows; second, MPTCP flows should be fair, indicating that SFs sharing a common bottleneck should occupy a capacity fairly close to that required by a single-path flow. Several MPTCP CCAs have been developed; however, they have failed to satisfy these challenges in all scenarios. Recently, Google has introduced the bottleneck bandwidth and round-trip-time (BBR), a new CCA for single-path TCP, achieving high throughput with minimum delay by employing a network model. In the present paper, we propose a novel MPTCP CCA based on BBR named coupled multipath BBR (C-MPBBR) that satisfies the fundamental challenges by exploiting the concept of network modeling in BBR. C-MPBBR addresses the first challenge by closing the lowbandwidth SFs by tracking the delivery rate and bottleneck bandwidth (BtlBW). Then, it satisfies the second challenge through identifying those SFs that share a common bottleneck and dividing the BtlBW share corresponding to a SF among them. We implemented C-MPBBR in the Linux kernel, tested it on a wide range of scenarios by the Mininet emulation experiments, and the real-world Internet, and confirmed that the proposed C-MPBBR outperforms the existing MPTCP CCAs in terms of successfully satisfying the fundamental challenges by ensuring both throughput and fairness.

show abstract

Section: A Experimental Setupmentioning

confidence: 94%

Section: A Experimental Setupmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

et al. 2020

View full text Add to dashboard Cite

show abstract

“…LIA could successfully shift the traffic from a congested path to a less congested path while improving throughput and fairness. However, LIA fails to fully utilize the underlying network due to its insistence on fairness [37].…”

Section: Related Workmentioning

confidence: 99%

D-OLIA: A Hybrid MPTCP Congestion Control Algorithm with Network Delay Estimation

Lubna

Mahmud

Kim

et al. 2021

Sensors

View full text Add to dashboard Cite

With the recent evolution of mobile technology, modern devices equipped with multiple communication interfaces have become popular. The multipath transmission control protocol (MPTCP) has evolved to facilitate multiple communication interfaces through a single TCP connection for faster Internet access. MPTCP congestion control algorithms (MPTCP-CCAs) control data flow by fulfilling three design goals, i.e., ensuring improvement over single-path flows, ensuring fairness, and balancing congestion. Current MPTCP-CCAs cannot fulfill these design goals. For example, the opportunistic-linked increase algorithm (OLIA), a well-known MPTCP-CCA in load balancing, often results in low throughput because it cannot properly utilize the underlying network. In addition, the current Internet has a rapidly changing characteristic due to a large amount of short-lived traffic, making it difficult for MPTCP-CCAs to cope. An awareness of prevailing network delay conditions might help MPTCP-CCAs to utilize the network capacity fully. Therefore, we propose dynamic OLIA (D-OLIA), a hybrid MPTCP-CCA that enhances the performance of OLIA by integrating an awareness of the current network delay condition for deciding the congestion window (CWND) decrease factor. We estimate the current network delay condition, i.e., less-congested or congested, by observing the changes in the round-trip-time (RTT). Based on the estimated network delay condition, we decide the CWND decrease factor in real-time for reducing the CWND during packet loss events. We implemented D-OLIA in the Linux kernel and experimented using the Mininet emulator. The emulation results demonstrate that D-OLIA successfully estimates current network delay conditions and results in approximately a 20% increased throughput compared to the original OLIA. Compared to certain MPTCP-CCAs, it also yields a highly improved performance in terms of throughput, RTT, packet retransmissions, and fairness among the MPTCP sub-flows.

show abstract

“…Wei et al [20] introduced a shared bottleneck-based congestion control mechanism for MPTCP in order to mitigate the outof-order packet arrival problem, by detecting the shared bottlenecks and estimating the congestion level of each MPTCP subflow. Lĺźbben et al [21] discussed the complex behaviors of MPTCP caused by the interaction of the loss-based congestion control and minimum Round-Trip Time (RTT) scheduling and then proposed several alternative congestion control algorithms for MPTCP as the corresponding countermeasure. Ferlin et al [22] designed a practical shared bottleneck detection (PSBD)-based congestion control mechanism for MPTCP in order to make MPTCP flows remain fair to the TCP flows in a shared bottleneck scenario.…”

Section: B Mptcp Congestion Control and Fairness Casesmentioning

confidence: 99%

Can Multipath TCP be Robust to Cyber Attacks With Incomplete Information?

et al. 2020

View full text Add to dashboard Cite

Promoted by the advancements in the various wireless access technologies, modern mobile devices equipped with multiple network interfaces are rapidly becoming the norm, and this provides a driving force for the large-scale deployment of the Multipath Transmission Control Protocol (MPTCP) in the current and future Internet. However, the simultaneous use of multiple network paths for concurrent multipath data transmission can make MPTCP have a larger attack surface than the traditional single-path transport protocols, and this may be likely to pose a risk of MPTCP being much more susceptible to cyber attacks. In this paper, we present a measurement method to investigate the vulnerability and robustness of MPTCP under cyber attacks with incomplete network information, by considering the fact that most cyber attacks normally lack of real-time information with respect to various MPTCP attributes. We mathematically characterize cyber attacks with incomplete network information from the viewpoints of both the cyber attacker and the MPTCP communication system, and then we introduce a mixed attack strategy, by jointly considering the features of both the random attacks and the selective attacks, to evaluate the robustness of MPTCP.

show abstract

An Odd Couple: Loss-Based Congestion Control and Minimum RTT Scheduling in MPTCP

Cited by 16 publications

References 19 publications

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

D-OLIA: A Hybrid MPTCP Congestion Control Algorithm with Network Delay Estimation

Can Multipath TCP be Robust to Cyber Attacks With Incomplete Information?

Contact Info

Product

Resources

About