mmS-TCP: Scalable TCP for Improving Throughput and Fairness in 5G mmWave Networks.

The millimeter-wave (mmWave) band, which can provide data rates of multi-gigabits per second, could play a major role in achieving the throughput goals of 5G networks. However, the high-bandwidth mmWave signal is susceptible to blockage by various obstacles, which results in very large and frequent degradation in the quality of the received signals. TCP, the most representative transport layer protocol, suffers from significant performance degradation due to the very dynamic channel conditions of the mmWave signal. Therefore, in this paper, we propose a congestion control algorithm that guarantees sufficient throughput in 5G mmWave networks and that does not significantly worsen TCP fairness. The proposed algorithm, which is a modification of Scalable TCP (S-TCP) that is designed for high-speed networks, provides a more stable performance than the existing TCP congestion control algorithm in mmWave networks through simple modifications. In various simulation experiments that considered the actual mobile user environment, the proposed mmWave Scalable TCP (mmS-TCP) algorithm demonstrated throughput up to 2.4 times higher than CUBIC TCP in single flow evaluation, and the inter-protocol fairness index when competing with CUBIC flow significantly improved from 0.819 of S-TCP to 0.9733. Moreover, the mmS-TCP algorithm reduced the number of duplicated ACKs by 1/4 compared with S-TCP, and it improved the average total throughput and intra-protocol fairness simultaneously.

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

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.

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

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.