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

Tabassum Lubna; Imtiaz Mahmud; Geon-Hwan Kim; You-Ze Cho

doi:10.3390/s21175764

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

Sensors ◽

10.3390/s21175764 ◽

2021 ◽

Vol 21 (17) ◽

pp. 5764 ◽

Cited By ~ 1

Author(s):

Tabassum Lubna ◽

Imtiaz Mahmud ◽

Geon-Hwan Kim ◽

You-Ze Cho

Keyword(s):

Congestion Control ◽

Transmission Control Protocol ◽

Network Capacity ◽

Delay Condition ◽

Network Delay ◽

Trip Time ◽

Congestion Control Algorithm ◽

Underlying Network ◽

Improved Performance ◽

Single Path

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.

Adaptive Decrease Window for BALIA (ADW-BALIA): Congestion Control Algorithm for Throughput Improvement in Nonshared Bottlenecks

Electronics ◽

10.3390/electronics10030294 ◽

2021 ◽

Vol 10 (3) ◽

pp. 294

Author(s):

Geon-Hwan Kim ◽

Yeong-Jun Song ◽

Imtiaz Mahmud ◽

You-Ze Cho

Keyword(s):

Congestion Control ◽

Control Algorithm ◽

Transmission Control Protocol ◽

Control Mechanisms ◽

Congestion Window ◽

Transmission Control ◽

Control Protocol ◽

Congestion Control Algorithm ◽

Lossy Links ◽

Single Path

The main design goals of the multipath transmission control protocol (MPTCP) are to improve the throughput and share a common bottleneck link fairly with a single-path transmission control protocol (TCP). The existing MPTCP congestion control algorithms achieve the goal of fairness with single-path TCP flows in a shared bottleneck, but they cannot maximize the throughput in nonshared bottlenecks, where multiple subflows traverse different bottleneck links. This is because the MPTCP is designed not to exceed the throughput of a single-path TCP competing in the bottleneck. Therefore, we believe that MPTCP congestion control should have different congestion window control mechanisms, depending on the bottleneck type. In this paper, we propose an adaptive decrease window (ADW) balanced linked adaptation (BALIA) congestion control algorithm that adaptively adjusts the congestion window decrease in order to achieve better throughput in nonshared bottlenecks while maintaining fairness with the single-path TCP flows in shared bottlenecks. The ADW-BALIA algorithm detects shared and nonshared bottlenecks based on delay fluctuations and it uses different congestion window decrease methods for the two types of bottleneck. When the delay fluctuations of the MPTCP subflows are similar, the ADW-BALIA algorithm behaves the same as the existing BALIA congestion control algorithm. If the delay fluctuations are dissimilar, then the ADW-BALIA algorithm adaptively modulates the congestion window reduction. We implement the ADW-BALIA algorithm in the Linux kernel and perform an emulation experiment that is based on various topologies. ADW-BALIA improves the aggregate MPTCP throughput by 20% in the nonshared bottleneck scenario, while maintaining fairness with the single-path TCP in the shared bottleneck scenario. Even in a triple bottleneck topology, where both types of bottlenecks exist together, the throughput increases significantly. We confirmed that the ADW-BALIA algorithm works stably for different delay paths, in competition with CUBIC flows, and with lossy links.

BA-MPCUBIC: Bottleneck-Aware Multipath CUBIC for Multipath-TCP

Sensors ◽

10.3390/s21186289 ◽

2021 ◽

Vol 21 (18) ◽

pp. 6289

Author(s):

Imtiaz Mahmud ◽

Tabassum Lubna ◽

Geon-Hwan Kim ◽

You-Ze Cho

Keyword(s):

High Speed ◽

Transmission Control Protocol ◽

Detection Accuracy ◽

Round Trip ◽

Effective Implementation ◽

Multipath Tcp ◽

Trip Time ◽

Bottleneck Detection ◽

Congestion Control Algorithm ◽

Single Path

The Congestion Control Algorithm (CCA) in the Multipath Transmission Control Protocol (MPTCP) is fundamental to controlling the flow of data through multiple subflows (SF) simultaneously. The MPTCP CCA has two design goals: first, always ensure better throughput than single path TCP (SPTCP) flows, and second, collectively, MPTCP SFs going through a shared bottleneck (SB) should occupy bandwidth fairly, i.e., close to the bandwidth occupied by an SPTCP flow. Although several MPTCP CCAs exist, they primarily focus on specific scenarios and could not satisfy the design goals in diverse and dynamic scenarios. Recently, CUBIC has become a widely used CCA for SPTCP for its better compatibility with high-speed internet. CUBIC’s effective implementation in the MPTCP is expected to provide improved throughput and fairer behavior, thus satisfying the design goals. However, although the current multipath CUBIC (MPCUBIC) implementation ensures better fairness, it fails to ensure better throughput. We believe the application of same rule for SFs going through an SB and non-shared bottleneck (NSB) makes it difficult for MPCUBIC to adapt to diverse and dynamically changing network scenarios, thus resulting in poor throughput. Therefore, we present an improved version of MPCUBIC, namely bottleneck-aware MPCUBIC (BA-MPCUBIC), to resolve the throughput issue. First, we deploy an innovative bottleneck detection method that successfully differentiates between an SB and NSB based on round-trip-time, enhanced congestion notification, and packet loss. Then, we implement SPTCP CUBIC and MPCUBIC as the CCAs for SFs going through NSBs and SBs, respectively. Extensive emulation experiments demonstrate that the BA-MPCUBIC successfully detects SBs and NSBs with the highest detection accuracy and the lowest detection time compared with other approaches. Moreover, BA-MPCUBIC successfully satisfies the MPTCP design goals in the considered diverse and dynamic scenarios by ensuring both better throughput and fairness.

Software-Defined Congestion Control Algorithm for IP Networks

Scientific Programming ◽

10.1155/2017/3579540 ◽

2017 ◽

Vol 2017 ◽

pp. 1-8 ◽

Cited By ~ 6

Author(s):

Yao Hu ◽

Ting Peng ◽

Lianming Zhang

Keyword(s):

Congestion Control ◽

Transmission Control Protocol ◽

Rapid Evolution ◽

Centralized Control ◽

Network Congestion ◽

Ip Network ◽

Key Factor ◽

Flow Information ◽

Underlying Network ◽

The Difference

The rapid evolution of computer networks, increase in the number of Internet users, and popularity of multimedia applications have exacerbated the congestion control problem. Congestion control is a key factor in ensuring network stability and robustness. When the underlying network and flow information are unknown, the transmission control protocol (TCP) must increase or reduce the size of the congestion window to adjust to the changes of traffic in the Internet Protocol (IP) network. However, it is possible that a software-defined approach can relieve the network congestion problem more efficiently. This approach has the characteristic of centralized control and can obtain a global topology for unified network management. In this paper, we propose a software-defined congestion control (SDCC) algorithm for an IP network. We consider the difference between TCP and the user datagram protocol (UDP) and propose a new method to judge node congestion. We initially apply the congestion control mechanism in the congested nodes and then optimize the link utilization to control network congestion.

Transmission Control Protocol and Active Queue Management together against congestion: cross-comparison through simulations

SIMULATION ◽

10.1177/0037549718814626 ◽

2018 ◽

Vol 95 (10) ◽

pp. 979-993

Author(s):

Carlo Augusto Grazia ◽

Natale Patriciello ◽

Martin Klapez ◽

Maurizio Casoni

Keyword(s):

Congestion Control ◽

Transmission Control Protocol ◽

Active Queue Management ◽

Queue Management ◽

Network Simulator ◽

Transmission Control ◽

Control Protocol ◽

Trip Time ◽

Multiple Round ◽

The One

Most Internet traffic is carried by the Transmission Control Protocol (TCP) nowadays, even in the case of real-time services. Detecting and mitigating the congestion is one of the primary tasks of this protocol, in fact, different TCP versions are defined by their congestion control algorithms. Furthermore, Active Queue Management (AQM) algorithms share the same goal of congestion mitigation with TCP; in particular, the most efficient congestion control occurs when AQM and TCP work together. This paper presents a brief survey and a cross-comparison of the latest and most important TCP and AQM variants, then provides an evaluation of a different kind of performance on the ns-3 network simulator over various types of environments (multiple Round Trip Time, long delay, different congestion levels, etc.). In any shared bottleneck, the choice of the TCP-AQM couple to adopt is crucial. We will show that the results are not univocal and the “one size fits all” solution does not exist. Moreover, the proper couple depends on the performance that we want to boost and on the environment that we have to deal with.

Optical Space Switches in Data Centers: Issues with Transport Protocols

Photonics ◽

10.3390/photonics6010016 ◽

2019 ◽

Vol 6 (1) ◽

pp. 16 ◽

Cited By ~ 1

Author(s):

Mamun Abu-Tair ◽

Philip Perry ◽

Philip Morrow ◽

Sally McClean ◽

Bryan Scotney ◽

...

Keyword(s):

Optical Networks ◽

Transmission Control Protocol ◽

Network Capacity ◽

Network Architectures ◽

Control Mechanisms ◽

Network Resource ◽

System A ◽

Improved Performance ◽

Total Capacity ◽

Detrimental Impact

A number of new architectures for data centre networks employing reconfigurable, SDN controlled, all-optical networks have been reported in recent years. In most cases, additional capacity was added to the system which unsurprisingly improved performance. In this study, a generalised network model that emulates the behaviour of these types of network was developed but where the total capacity is maintained constant so that system behaviour can be understood. An extensive emulated study is presented which indicates that the reconfiguration of such a network can have a detrimental impact on Transmission Control Protocol (TCP) congestion control mechanisms that can degrade the performance of the system. A number of simple scheduling mechanisms were investigated and the results show that an on-demand scheduling mechanism could deliver a throughput increase of more than ∼50% without any increase in total installed network capacity. These results, therefore, indicate the need to link the network resource management with new datacentre network architectures.

An Improved Adaptive CoAP Congestion Control Algorithm

International Journal of Online and Biomedical Engineering (iJOE) ◽

10.3991/ijoe.v15i03.9122 ◽

2019 ◽

Vol 15 (03) ◽

pp. 96 ◽

Cited By ~ 2

Author(s):

Fathia Ouakasse ◽

Said Rakrak

Keyword(s):

Congestion Control ◽

Control Algorithm ◽

Network Resources ◽

Analysis And Evaluation ◽

Trip Time ◽

Time Out ◽

Congestion Control Algorithm ◽

Network Operation ◽

Congestion Control Mechanism ◽

Do So

The Constrained Application Protocol (CoAP) is one of the most emerging messaging protocols that have successfully fulfilled the need of the lightweight feature required to handle communication between constrained devices in IoT environment. However, these devices are generating a huge amount of messages and notifications which cause the network congestion. Then, the challenge addressed in this paper; consists of designing a suitable congestion control mechanism for CoAP that ensures a safe network operation while keeping the use of network resources efficient. To do so, this paper presents an improved congestion control algorithm for the estimation of a Retransmission Time Out (RTO) value to use in each transaction based on the packet loss ratio and the Round-Trip Time RTT of the previous transmission. A comprehensive analysis and evaluation of simulated results show that the proposed mechanism can appropriately achieve higher performance compared to the basic CoAP congestion control and alternative algorithms based on TCP.

An Analysis to Improve Congestion Algorithm of TCP

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.171-172.756 ◽

2010 ◽

Vol 171-172 ◽

pp. 756-759

Author(s):

Kun Shang ◽

Zhi Hua Zhai

Keyword(s):

Congestion Control ◽

Data Transmission ◽

Control Algorithm ◽

Round Trip Time ◽

Round Trip ◽

Trip Time ◽

Congestion Control Algorithm ◽

End To End

Congestion is an important issue in the research of end-to-end congestion control. The congestion issue in transmission with TCP is studied. Under the situation of different round trip time and multiple congested gateways, ECC (Explicit Congestion Control) algorithm is proposed to solve the congestion problem of TCP. The basic idea is to explicitly improve Congestion by adding mechanism at both end systems and gateways. Then study the tile congestion of Internet data transmission. Internet data transmission relies on end system mechanisms to keep Congestion. As the number of the users has been very large, this scheme has become vulnerable. It is required to deploy some congestion mechanism at gateways.

Development of an efficient mechanism for rapid protocols using NS-2 simulator

APTIKOM Journal on Computer Science and Information Technologies ◽

10.34306/csit.v3i1.77 ◽

2020 ◽

Vol 3 (1) ◽

pp. 13-20

Author(s):

Sarah N. Abdulwahid

Keyword(s):

Congestion Control ◽

High Speed ◽

Control Algorithm ◽

Transmission Control Protocol ◽

Control Process ◽

Congestion Avoidance ◽

Network Simulator ◽

Improvement Strategy ◽

Slow Start ◽

Congestion Control Algorithm

The delivered effort in this manuscript is grounded on NS-2 (The Network Simulator 2) to implement the congestion control process of classic TCP (Transmission Control Protocol), with new congestion control mechanism. In this paper, a novel congestion control algorithm is offered, which contains of slow-start and congestion avoidance mechanisms. The proposed slow-start algorithm assumes a duplicating and an interpolating approach to the congestion window (cwnd) for each increment instead of the exponential increment used by other TCP source variants such as Reno, Vega, Tahoe, Newreno, Fack, and Sack. Furthermore, the enhanced congestion avoidance algorithm is built by using an improved Additive Increase Multiplicative Decrease (AIMD) algorithm with multi TCP flow facility, to provide an enhanced congestion control algorithm with some valuable properties to improve TCP routine for high speed protocols. The improvement strategy based on merging of slow start, congestion avoidance mechanism that are used in TCP congestion control, to create a new AIMD algorithm with a new relationship between the pair parameters a and b. This paper is also involved in the creation of rapid agent in NS-2 models designed to identify the modified TCP and to configure the NS-2 platform. A fast TCP also includes an innovative scheme to slow the rapid start to help TCP to start faster through the high speed networks and also to postpone the congestion state as much as possible.

A MPTCP Congestion Control Algorithm Based on Packet Loss

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.401-403.1760 ◽

2013 ◽

Vol 401-403 ◽

pp. 1760-1765

Author(s):

Lan Kou ◽

Rui Wang ◽

Si Rui Chen

Keyword(s):

Congestion Control ◽

Packet Loss ◽

Working Group ◽

Control Algorithm ◽

Transmission Control Protocol ◽

Network Throughput ◽

Network Resources ◽

Transmission Control ◽

Resource Pooling ◽

Congestion Control Algorithm

Multipath Transmission Control Protocol (MPTCP) is proposed by the IETF working group in 2009, can provide end-to-end multi-channel communication, can greatly increase the utilization of network resources and reliability. The study of the details is underway. Congestion control is one of the main issues in MPTCP study. Its goal is to ensure network throughput, to ensure the fairness of the network and to balance congestion .So this paper mainly studies congestion control algorithm. In terms of resource pooling, we propose a MPTCP congestion control algorithm based on packet loss. The algorithm can guarantee the network throughput and improve the fairness among users ,at the same time, the algorithm greatly achieve resource pooling.

Analisis Kinerja Algoritme TCP Congestion Control Berdasarkan Single dan Multiple Flow pada Multi-Path Routing

Jurnal Teknologi Informasi dan Ilmu Komputer ◽

10.25126/jtiik.2020752402 ◽

2020 ◽

Vol 7 (5) ◽

pp. 961

Author(s):

Bayu Sutawijaya ◽

Achmad Basuki ◽

Fitra Abdurrachman Bachtiar

Keyword(s):

Congestion Control ◽

Loss Rate ◽

Packet Reordering ◽

Tcp Protocol ◽

Multiple Flows ◽

Congestion Control Algorithm ◽

Multiple Paths ◽

Tcp Congestion Control ◽

Single Flow ◽

Single Path

Teknik multi-path routing merupakan solusi efektif untuk menambah kapasitas bandwidth jaringan. Namun, TCP menggunakan multiple paths sama dengan di single path. Penelitian ini melakukan analisis kinerja algoritme TCP congestion control Reno, BIC, CUBIC, dan BBR pada multi-path routing dengan setiap multiple paths menggunakan cost yang sama. Analisis yang dilakukan meliputi perbandingan antara single path routing dengan multi-path routing, single flow, dan multiple flow. Analisis single flow meliputi link delay dan loss rate. Sedangkan analisis multiple flow meliputi inter TCP protocol fairness dan fairness antara TCP dengan UDP. Semua evaluasi dilakukan berdasarkan emulasi pada VirtualBox. Berdasarkan hasil emulasi, multi-path routing dapat berdampak pada packet reordering, tetapi tidak mengakibatkan penurunan rata-rata throughput yang signifikan. Pada single flow, BBR merupakan algoritme TCP congestion control terbaik pada multi-path routing. Namun, pada multiple flow, CUBIC merupakan algoritme TCP congestion control terbaik pada multi-path routing. Pada evaluasi link delay, rata-rata RTT BBR lebih rendah hingga 58 ms dibandingkan dengan Reno, BIC, dan CUBIC. Sedangkan pada evaluasi loss rate, rata-rata throughput BBR lebih tinggi hingga 12 Mbps dibandingkan dengan Reno, BIC, dan CUBIC. Pada evaluasi inter TCP protocol fairness dan fairness antara TCP dengan UDP, fairness CUBIC paling mendekati 1 dibandingkan dengan Reno, BIC, dan BBR. AbstractThe multi-path routing technique is an effective solution to increase network bandwidth capacity. However, TCP uses multiple paths similar to a single path. This study analyzes the performance of TCP congestion control algorithms Reno, BIC, CUBIC, and BBR on multi-path routing with each multiple paths using the same cost. The analysis includes a comparison between single path routing and multi-path routing, single flow, and multiple flows. In a single flow, the analysis includes link delay and loss rate. Whereas in multiple flows, the analysis includes inter TCP protocol fairness and fairness between TCP and UDP. All evaluations are based on emulation in VirtualBox. Based on the results from emulation, multi-path routing can have an impact on packet reordering but does not result in a significant degrade in average throughput. In a single flow, BBR is the best TCP congestion control algorithm on multi-path routing. However, in multiple flows, CUBIC is the best TCP congestion control algorithm on multi-path routing. In the link delay evaluations, the average RTT on BBR up to 58 ms lower than Reno, BIC, and CUBIC. Whereas in the loss rate evaluations, the average throughput on BBR up to 12 Mbps higher than Reno, BIC, and CUBIC. In the evaluation of inter TCP protocol fairness and fairness between TCP and UDP, fairness on CUBIC is closest to 1 than Reno, BIC, and BBR.