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

Sensors ◽  
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.

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

Sensors ◽  
2021 ◽  
Vol 21 (17) ◽  
pp. 5764 ◽  
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.

Fuzzy Logic-Based Round Trip Time Scaling and Scheduling in High Speed TCP Stacks

2015 ◽  
pp. 448-461
Author(s):  
V. Kavidha ◽  
V. Sadasivam
Keyword(s):  
High Speed ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Complex Problem ◽  
Round Trip Time ◽  
Round Trip ◽  
Congestion Window ◽  
Trip Time ◽  
Time Scaling ◽  
End Node

Network management and control is a complex problem that requires intelligent, control methodologies to obtain satisfactory performance. Round trip time (RTT) scaling mechanism has been introduced for changing congestion window and to perform congestion control satisfactorily in all circumstances. This paper presents a fuzzy RTT scaling (FRTTS) scheme that performs RTT scaling and RTT scheduling for different high speed transmission control protocol (TCP) networks. In this scheme, RTT samples are allocated requesting application by using RTT scheduling factor and RTT samples are scaled for an application by using RTT scaling factor. A RTT scaler placed at the end node performs the RTT scheduling as well as RTT scaling. We also apply a FRTTS scheme on different high speed TCP's namely high-TCP (H-TCP) and scalable-TCP(S-TCP) and demonstrates that it provides better performance than non fuzzy scheme. The scheme has been extensively simulated to test the performance in terms of flow rate, RTT flows, packet size and congestion window size. The results show that FRTTS scheme provides better performance than non fuzzy scheme which employs dynamic RTT scheduling and RTT scaling.

Fuzzy Logic-Based Round Trip Time Scaling and Scheduling in High Speed TCP Stacks

2013 ◽  
Vol 3 (2) ◽  
pp. 71-86
Author(s):  
V. Kavidha ◽  
V. Sadasivam
Keyword(s):  
High Speed ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Complex Problem ◽  
Round Trip Time ◽  
Round Trip ◽  
Congestion Window ◽  
Trip Time ◽  
Time Scaling ◽  
End Node

Network management and control is a complex problem that requires intelligent, control methodologies to obtain satisfactory performance. Round trip time (RTT) scaling mechanism has been introduced for changing congestion window and to perform congestion control satisfactorily in all circumstances. This paper presents a fuzzy RTT scaling (FRTTS) scheme that performs RTT scaling and RTT scheduling for different high speed transmission control protocol (TCP) networks. In this scheme, RTT samples are allocated requesting application by using RTT scheduling factor and RTT samples are scaled for an application by using RTT scaling factor. A RTT scaler placed at the end node performs the RTT scheduling as well as RTT scaling. We also apply a FRTTS scheme on different high speed TCP’s namely high-TCP (H-TCP) and scalable-TCP(S-TCP) and demonstrates that it provides better performance than non fuzzy scheme. The scheme has been extensively simulated to test the performance in terms of flow rate, RTT flows, packet size and congestion window size. The results show that FRTTS scheme provides better performance than non fuzzy scheme which employs dynamic RTT scheduling and RTT scaling.

An Improved TCP Congestion Control Algorithm in High Speed Satellite Links

2014 ◽  
Vol 667 ◽  
pp. 129-132
Author(s):  
Feng Liu ◽  
Dong Po Ren
Keyword(s):  
Error Rate ◽  
High Speed ◽  
Transmission Rate ◽  
Packet Error Rate ◽  
Bandwidth Utilization ◽  
Available Bandwidth ◽  
Trip Time ◽  
Geo Satellite ◽  
Satellite Links ◽  
Congestion Control Algorithm

The throughput of traditional TCP degrades drastically in high speed satellite links, where the characteristics of long round trip time (RTT) and high bit error rate (BER) happen together. Two typical improved algorithms, Hybla and Westwood, are designed to solve the problems of long RTT and high BER respectively. TCP-HW which combines the advantages of Hybla and Westwood is proposed in this paper, on the basis of consideration of both long RTT and high BER. At slow start and congestion avoidance phase, TCP-HW adopts a radical congestion window (cwnd) growth policy to eliminate the low data transmission rate bring by long RTT as Hybla does. At fast retransmit and fast recover phase, TCP-HW updates the cwnd according to the estimated available bandwidth in Westwood to avoid the frequently unnecessary reduction of cwnd due to high BER. There, the cwnd can be kept large enough to achieve high throughput. Simulation results in NS2 indicate that the change of RTT and packet error rate (PER) has little impact on TCP-HW and the bandwidth utilization of TCP-HW can reach more than fifty percent in the 1Gbps GEO satellite link with 500ms RTT and 0.001 PER. In addition, TCP-HW still have good fairness.

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

Electronics ◽  
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.

An Analysis to Improve Congestion Algorithm of TCP

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.

scholarly journals Analisis Optimasi Round Trip Time (RTT) pada Jaringan Transmission Control Protocol (TCP) New Reno

2020 ◽  
Vol 4 (2) ◽  
pp. 92
Author(s):  
Harry Idwan ◽  
Ihsanuddin Ihsanuddin
Keyword(s):  
Wireless Network ◽  
Ad Hoc ◽  
Transmission Control Protocol ◽  
Round Trip Time ◽  
Round Trip ◽  
Coffee Shop ◽  
Data Packets ◽  
Wireless Network Coding ◽  
Trip Time ◽  
Good Technique

The research objective is to simulate and analyze existing algorithms developed previously using the NS-3 application, which affects the measurement of RTT, cwnd, and throughput, and to evaluate the performance of TCP New Reno based on topology and research parameters so that it is obtained specifically how to optimize RTT and throughput on wireless networks. at the Banda Aceh City coffee shop. The research method simulates and analyzes the development of the TCP New Reno algorithm on wireless network coding so that the results can be applied directly. The approach describes a variety of steps or techniques based on a certain distance in increasing throughput, controlling the congestion window (cwnd) and reducing RTO. The results of the study concluded that the use of the TCP New Reno algorithm on a wireless network for multi-hop ad-hoc topology (5 nodes) produced better values than single-hop (2 nodes). The TCP New Reno algorithm has a retransmit phase (at flow-1 and flow-2) which indicates that the slow start phase again starts, cwnd will effectively double (slowly add data) the size of the windows RTT (time) thereby reducing the loss of data packets. In general, strategies and techniques based on distance (6 m and 3 m) in achieving RTT optimization, the TCP New Reno's network strategy of 3 m is a good technique, especially in multi-hop.Keywords:TCP New Reno, RTT, Cwnd, Throughput, Coffee Shop

scholarly journals Design and Development of Efficient Multipath TCP for Data Center in Public Cloud

2019 ◽  
Vol 8 (4) ◽  
pp. 3575-3579
Keyword(s):  
Data Center ◽  
Network Flow ◽  
High Speed ◽  
Data Transfer ◽  
Transmission Control Protocol ◽  
Public Cloud ◽  
Application Development ◽  
Cloud Data ◽  
Multipath Tcp ◽  
High Speed Data

In recent days, variety of application development making use of cloud data centers effectively for analyzing data, processing related applications such as interactive and batch processing. Some of the factors influence on network performance by maintaining low delay, high-speed data transfer and more reliability. Maintaining and satisfying these factors becomes a challenging issue due to dynamic variations on network. TCP (Transmission control Protocol) proposed recently a new concept of multi-path TCP (MPTCP) for maximum utilization of paths over network flow. In spite of its added advantages, some sort of work on MPTCP to be carried out on cloud environment and further, efficient way of using MPTCP on real-world cloud application still looks like unclear problem. Our proposed work concerned on MPTCP usage in most effective and feasible way for cloud and data center environments over various conditions on network. The experiment is conducted by clustering the public cloud data using k-means algorithm and communicated over a network using MPTCP. The results shows that the proposed method yields high-speed data transfer and low communication delay when compare to traditional TCP technique.

Sign in / Sign up

Export Citation Format

Share Document