D-LIA: Dynamic congestion control algorithm for MPTCP

Lubna, Tabassum; Mahmud, Imtiaz; Cho, You-Ze

doi:10.1016/j.icte.2020.03.005

Cited by 20 publications

(23 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the aforementioned coupled CC algorithms are primarily focused on the increase of the cwnd, while neglecting the cwnd decreasing mechanism [ 67 ] ( Figure 4 ), authors in Ref. [ 68 ] proposed a loss-based MP-TCP CC algorithm called Dynamic-LIA (D-LIA). Instead of halving the cwnd after packet lost occurrence, the D-LIA decreases the cwnd by a dynamically determined factor that depends on the interval between each packet loss [ 68 ].…”

Section: Tcp Congestion Controlmentioning

confidence: 99%

“…[ 68 ] proposed a loss-based MP-TCP CC algorithm called Dynamic-LIA (D-LIA). Instead of halving the cwnd after packet lost occurrence, the D-LIA decreases the cwnd by a dynamically determined factor that depends on the interval between each packet loss [ 68 ]. Using this approach, cwnd can reach its optimal size much faster than the regular the TCP AIMD mechanism and thus reduce overall network latency and better utilize network resources.…”

Section: Tcp Congestion Controlmentioning

confidence: 99%

“…Using this approach, cwnd can reach its optimal size much faster than the regular the TCP AIMD mechanism and thus reduce overall network latency and better utilize network resources. Although the D-LIA achieves better overall performance in terms of throughput and fairness, the authors have detected a downside related to increased packet retransmissions [ 68 ].…”

Section: Tcp Congestion Controlmentioning

confidence: 99%

See 2 more Smart Citations

A Comprehensive Overview of TCP Congestion Control in 5G Networks: Research Challenges and Future Perspectives

Lörincz

Klarin

Ožegović

2021

Sensors

View full text Add to dashboard Cite

In today’s data networks, the main protocol used to ensure reliable communications is the transmission control protocol (TCP). The TCP performance is largely determined by the used congestion control (CC) algorithm. TCP CC algorithms have evolved over the past three decades and a large number of CC algorithm variations have been developed to accommodate various network environments. The fifth-generation (5G) mobile network presents a new challenge for the implementation of the TCP CC mechanism, since networks will operate in environments with huge user device density and vast traffic flows. In contrast to the pre-5G networks that operate in the sub-6 GHz bands, the implementation of TCP CC algorithms in 5G mmWave communications will be further compromised with high variations in channel quality and susceptibility to blockages due to high penetration losses and atmospheric absorptions. These challenges will be particularly present in environments such as sensor networks and Internet of Things (IoT) applications. To alleviate these challenges, this paper provides an overview of the most popular single-flow and multy-flow TCP CC algorithms used in pre-5G networks. The related work on the previous examinations of TCP CC algorithm performance in 5G networks is further presented. A possible implementation of TCP CC algorithms is thoroughly analysed with respect to the specificities of 5G networks, such as the usage of high frequencies in the mmWave spectrum, the frequent horizontal and vertical handovers, the implementation of the 5G core network, the usage of beamforming and data buffering, the exploitation of edge computing, and the constantly transmitted always-on signals. Moreover, the capabilities of machine learning technique implementations for the improvement of TCPs CC performance have been presented last, with a discussion on future research opportunities that can contribute to the improvement of TCP CC implementation in 5G networks. This survey paper can serve as the basis for the development of novel solutions that will ensure the reliable implementation of TCP CC in different usage scenarios of 5G networks.

show abstract

Section: Tcp Congestion Controlmentioning

confidence: 99%

Section: Tcp Congestion Controlmentioning

confidence: 99%

Section: Tcp Congestion Controlmentioning

confidence: 99%

See 1 more Smart Citation

A Comprehensive Overview of TCP Congestion Control in 5G Networks: Research Challenges and Future Perspectives

Lörincz

Klarin

Ožegović

2021

Sensors

View full text Add to dashboard Cite

show abstract

“…The results showed higher throughput and lower network congestion. In addition, the authors in [32] dynamically adjusted the congestion window according to the requirement of the application. This method results in lower packet loss and better throughput.…”

Section: Related Workmentioning

confidence: 99%

Reduce delay of multipath TCP in IoT networks

2021

View full text Add to dashboard Cite

Multi-homed devices such as smartphones, tablets and laptops are enabled with multiple heterogeneous interfaces available for transmission. Those interfaces can be utilized for simultaneous transmission of a single TCP flow using Multipath TCP (MPTCP). MPTCP is a protocol that is designed to increase end-to-end throughput and reliability of communications by splitting data through multiple parallel paths. Although delay in MPTCP enhanced significantly in the recent years, high number of data transmissions remains an issue. In this paper, we reduce MPTCP delay by reducing the number of transmissions using Opportunistic Routing (OR) technique. OR is a routing model used to increase the delivery rate and reliability of data transmission in wireless networks by using the broadcasting method. This enables each subflow data to be delivered by multiple relays. We adapted OR on a number of MPTCP protocols namely, traditional MPTCP, Multipath TCP Traffic Splitting Control (MPTCP-TSC) and Redundant MPTCP (ReMP TCP) in an Internet of Things (IoT) environment. The results show that OR-based MPTCP schemes outperform existing schemes. We further compared the OR-based MPTCP protocols in terms of startup delay and energy efficiency. We found that ReMP TCP is better than other schemes in all scenarios.

show abstract

“…When sharing a common bottleneck, the total capacity occupied by the MPTCP SFs sharing that bottleneck should be fairly close to that of a singlepath flow; in other words, MPTCP flows should be fair. 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].…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2020

Self Cite

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

D-LIA: Dynamic congestion control algorithm for MPTCP

Cited by 20 publications

References 5 publications

A Comprehensive Overview of TCP Congestion Control in 5G Networks: Research Challenges and Future Perspectives

A Comprehensive Overview of TCP Congestion Control in 5G Networks: Research Challenges and Future Perspectives

Reduce delay of multipath TCP in IoT networks

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

Contact Info

Product

Resources

About