FAST Transmission Control Protocol Research Articles

Intelligent TCP Congestion Control Scheme in Internet of Deep Space Things Communication

In deep space missions, large-scale deep space information and continuous sensory data are generated, processed, and exchanged over Internet of deep space things (IoDST). Ensuring reliable communication in IoDST requires resolution of challenges engendered by the unique characteristics of IoDST, including long propagation delays, link outages, high error rates, and asymmetric bandwidths. Thus, transmission control protocol (TCP) layer functionalities are crucial for ensuring reliable IoDST communications. However, existing TCP congestion control (CC) protocols present poor performance in IoDST communications, owing to the dependence of traditional window-based CC approaches on pre-configured rules to adjust transmission rate against the aforementioned unique characteristics. In this paper, we propose an intelligent CC scheme called optimistic actor–critic-based TCP congestion control (OAC-TCPCC) to solve the problems of the challenging link conditions in IoDST. OAC-TCPCC dynamically determines optimal congestion window for data transmission over IoDST communication links to maximize the TCP throughput performance and minimize file transfer time. Simulation results reveal that OAC-TCPCC improves the TCP throughput performance by up to 27%, 79%, 92%, 477%, 643%, and 766%; and reduces file transfer time by up to 16%, 37%, 50%, 48%, 58%, and 79%, compared to DRL-CC, TP-Planet, FAST TCP, TCP Peach, TCP BBR, and TCP CUBIC, respectively.

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

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.

Enhanced Multistream Fast TCP: Rapid Bandwidth Utilization after Fast-Recovery Phase

The purpose of this study is to enhance the performance of Multistream Fast Transmission Control Protocol (TCP) keeping in view the recent web-based applications that are being deployed on long-range, high-speed, and high-bandwidth networks. To achieve the objective of the research study, a congestion control after fast-recovery module for congestion control scheme of Multistream Fast TCP is proposed. The module optimized the performance of the protocol by reducing the time that is required to consume the available bandwidth after a fast-recovery phase. The module is designed after studying additive-increase, multiplicative-decrease and rate-based congestion window management schemes of related transport protocols. The module adjusts the congestion window on receipt of each individual acknowledgment instead of each round trip time after the fast-recovery phase until it consumes vacant bandwidth of the network link. The module is implemented by using Network Simulator 2. Convergence time, throughput, fairness index, and goodput are the parameters used to assess the performance of proposed module. The results indicate that Enhanced Multistream Fast TCP with congestion control after fast recovery recovers its congestion window in a shorter time period as compared to multistream Fast TCP, Fast TCP, TCP New Reno, and Stream Control Transmission Protocol. Consequently, Enhanced Multistream Fast TCP consumes the available network bandwidth in lesser time and increases the throughput and goodput. The proposed module enhanced the performance of the transport layer protocol. Our findings demonstrate the performance impact in the form of a decrease in the convergence time to consume the available network bandwidth and the increase in the throughput and the goodput.

Proposal of cross‐layer bandwidth assignment with buffer size indication for TCP flow control

AbstractIn this paper, we propose, verify, and evaluate a method combining cross‐layer method and bandwidth allocation to overcome the difficulty of flow control in a network with large bandwidth delay product. When the bandwidth delay product is large, there are problems with the convergence time, efficiency and stability of bandwidth utilization, and fairness among traffics of different round‐trip time. As a result of examining the conventional methods, we propose a novel method that can be realized as a functional addition to the existing transmission control protocol (TCP) flow control with improvement in utilization efficiency, fairness, stability, and convergence time. The method is compared with TCP Reno, FAST TCP, CUBIC, Explicit Congestion Notification, and eXplicit Control Protocol by simulation, and is confirmed as having good characteristics.

Enhancing Fast TCP’s Performance Using Single TCP Connection for Parallel Traffic Flows to Prevent Head-of-Line Blocking

Hypertext Transfer Protocol-2 (HTTP/2) partially resolved the problem of Head-of-Line Blocking (HoLB) by multiplexing independent messages at the application layer. This enables simultaneous transmission of multiple requests over the same connection independently. However, this technique becomes ineffective when packet loss occurs in the Transmission Control Protocol (TCP) flow in which case all the independent streams are blocked until the retransmission of the lost packet; this problem is known as HoLB at TCP-level. The problem arises because the underlying TCP does not differentiate between independent messages/streams from application layer protocol. This study proposes a multistream framework for Fast TCP to support multiple independent messages/streams of the application. The proposed framework uses separate flows, buffers, and segments for each independent stream, and interleaves these segments over a single TCP connection. It makes TCP compatible with HTTP/2, reduces data delivery latency between transport and application layer, and alleviates head-of-line blocking. We implemented this framework in Fast TCP and carried out a simulation-based comparison between Multistream Fast TCP (MFast TCP) and Stream Control Transmission Protocol (SCTP). Our results show that MFast TCP significantly improved performance over SCTP in the event of HoLB.

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

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.

USN을 위한 RTT 기반 TCP 설계 및 구현

We design and implement a RTT (Round Trip Time) based TCP (Transmission Control Protocol) for USN (Ubiquitous Sensor Network). We adopt a basic update algorithm for window size from FAST TCP that uses the queuing delay at link as the congestion measure. The designed TCP estimates the queuing delay at link from the measured RTT in the network layer, and updates the window size based on the estimated queuing delay. The designed TCP allows to utilize the full capacity of USN links and avoids the waste of the given link capacity that is common without the flow control in the transport layer. The experiment results show that the window size of the sender converges within a small range of variations without any packet loss, and verify the stability and performance of the designed TCP.

On the fairness characteristics of FAST TCP

Fairness of competing transmission control protocol (TCP) flows is an integral and indispensable part of transport protocol design for next-generation, high-bandwidth-delay product networks. It is not just a protocol-intrinsic property but it could also have severe impact on quality of experience (QoE). In this paper, we revisit FAST TCP fairness behavior based on a comprehensive performance evaluation study. We demonstrate that FAST TCP with proper parameter settings can always achieve fair behavior with HighSpeed TCP and Scalable TCP. We also show that this behavior is a rather robust property of the protocol concerning different traffic mix or network topology. The dynamic behavior of reaching the fair equilibrium state can be different, which is demonstrated in the paper. Our study also emphasizes the important need for finding a dynamic sensitive fairness metric for performance evaluation of transport protocols for next-generation, high-bandwidth-delay product networks.

A TCP acceleration algorithm for a wireless link using rate adaptation based on round-trip-time and virtual receiver window information

Fast transmission control protocol (TCP) was previously proposed for high capacity network environments with long delay, and TCP with Snoop performs better than conventional TCP enhancements in mobile wireless network environments. However, FAST TCP has limitations when used over a dynamic mobile wireless link with a high frame error ratio (FER) and frequent delay changes due to the variable rate. We propose an enhanced TCP acceleration algorithm at the TCP sender side which efficiently adapts to the maximum transmission rate of a mobile wireless link using the round trip time (RTT) and virtual receiver window (RWND) information. The proposed algorithm provides superior performance over mobile wireless network environments.

Experimental comparison of high-speed transmission control protocols on a traffic-driven labeled optical burst switching network test bed for grid applications

It is well known that the classic transmission control protocol (TCP) Reno is inadequate to address the requirements of emerging grid applications on an optical burst switching (OBS) network. To find the most efficient TCP in the scenario of grid over OBS, in this paper, the implementation of a traffic-driven labeled OBS (LOBS) network test bed is presented and the performance of several prominent high-speed TCPs, including HSTCP, TCP Westwood, and FAST TCP, are experimentally compared over the test bed. A modified theoretical model for TCP Reno over OBS is investigated, which is more accurate in modeling TCP Reno throughput compared with previous works and can further verify the experimental results.

An Improved Link Model for Window Flow Control and Its Application to FAST TCP

This paper presents a link model which captures the queue dynamics in response to a change in a transmission control protocol (TCP) source's congestion window. By considering both self-clocking and the link integrator effect, the model generalizes existing models and is shown to be more accurate by both open loop and closed loop packet level simulations. It reduces to the known static link model when flows' round trip delays are identical, and approximates the standard integrator link model when there is significant cross traffic. We apply this model to the stability analysis of fast active queue management scalable TCP (FAST TCP) including its filter dynamics. Under this model, the FAST control law is linearly stable for a single bottleneck link with an arbitrary distribution of round trip delays. This result resolves the notable discrepancy between empirical observations and previous theoretical predictions. The analysis highlights the critical role of self-clocking in TCP stability, and the proof technique is new and less conservative than existing ones.