Slow Start Algorithm Research Articles

A Transmission Rate Control Method for Active Congestion Reduction Based on Network Node Bandwidth Allocation

The control of transmission rates is currently a major topic in network research, as it plays a significant role in determining network performance. Traditional network design principles suggest that network nodes should only be responsible for forwarding data, while the sending node should manage control. However, sending nodes often lack information about network resources and must use slow-start algorithms to increase the transmission rate, potentially leading to wasted bandwidth and network congestion. Furthermore, incorrect judgments about network congestion by sending nodes may further reduce network throughput. The emergence of new Internet architectures, such as information-centric networks (ICNn), has empowered network nodes with more capabilities, including computation and caching. This paper proposes a method for transmission rate control that actively avoids congestion through network node bandwidth allocation. The sending, network, and receiving nodes each calculate the available transmission rate, and the sending node negotiates with the other nodes through a rate negotiation message to obtain the maximum transmission rate possible given the current state of the network. The network nodes notify the sending node to adjust the transmission rate to adapt to changes in the network through a rate adjustment message. Simulation experiments show that the proposed method is better than traditional methods in reducing network congestion, providing a stable transmission rate, increasing the network throughput capacity, and improving performance in high-latency and high-bandwidth networks. Additionally, the proposed transmission rate control method is fairer than traditional methods.

Formation of Innovative Algorithm for High Speed Protocol using Network Simulator

The effort delivered in this manuscript is grounded on NS-2 (The Network Simulator 2) to implementing 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 improving TCP routine for high speed protocols.

Congestion Analysis of Transport Layer in a Multicell 5G DL Communication System.

The fifth generation (5G) marks an important advance in mobile network capabilities. When it comes to high data rates, capacity, spectrum efficiency, and availability, 5G mobile broadband goes above and beyond what was previously possible with standard mobile broadband. The construction of 5G networks is still in the planning stages. These 5G networks will create intelligent networked communication environments by connecting people, things, data, applications, and transport networks. Mobile networks have made it possible for customers' mobile devices (such as smartphones, tablets, laptops, and so on) to connect to the internet. A variety of distinct protocols will be required to take into consideration the various aspects that 5G possess. One of these is the transport protocol, which is intended to deliver extremely high data transfer rates up to 400 Gbps. The transmission control protocol (TCP) is one of the numerous protocols that are necessary for supporting 5G's many capabilities. Our work focuses on the detection and analysis, on the downlink (DL) side, of the congestion of the transport layer in single- and multicell environments. For the purpose of the analysis, the following metrics were analyzed: physical resource blocks (PRBs), user throughput, cell throughput, cell edge user throughput, and delay. The work emphasizes the activation of the TCP slow-start algorithm using file transfer protocol (FTP) model two according to 3GPP standards.

Performance and improvements of TCP CUBIC in low-delay cellular networks

Growing Internet usage on mobile devices in cellular networks makes it increasingly important to assure good performance for web traffic, which often consists of many short-lived TCP flows. For TCP, and in the future likely also for QUIC, CUBIC is the most widely deployed congestion control algorithm. With Linux, HyStart is used as default Slow Start algorithm. In this paper we investigate performance impairments occurring when the combination of CUBIC and HyStart is used in low-delay cellular networks. To explain the problem in detail, we present measurements of characteristic per-packet round-trip times caused by uplink scheduling in mobile networks. Inherent round-trip time variations often trigger an early exit of Slow Start, causing CUBIC to underutilize the available capacity. In addition, we extend earlier throughput models for TCP CUBIC to accurately estimate the throughput for short-lived flows as a function of the congestion window size at the Slow Start exit point. We validate the model by measurement results. Further, we propose two HyStart improvements enhancing TCP CUBIC’s performance significantly. In our LTE testbed the mean throughput of a 5MB data transfer increases by 10.5%. Given the nature of web traffic, these fixes can improve the web experience of users noticeably. This shows the importance of measurements, testing, and subsequent optimizations when designing and evaluating transport and congestion control mechanisms for mobile networks.

LDAB-GPSR: Location PreDiction with Adaptive Beaconing – Greedy Perimeter Stateless Routing Protocol for Mobile Ad Hoc Networks

In mobile ad-hoc networks (MANET), nodes are randomly distributed and move freely, and hence the network may face rapid and unexpected topological changes. In this paper, an improved greedy perimeter stateless routing protocol, called “LDAB-GPSR”, is proposed. LDAB-GPSR mainly focuses on maximizing the packet delivery ratio while minimizing the control overhead. In order to accomplish this, two techniques are introduced, the first one is the location prediction technique in which the greedy forwarding strategy is improved by choosing more stable routes for data forwarding. The second one is the adaptive beaconing technique in which the slow start algorithm is employed to adapt the beacon packet interval time based on the mobility of nodes and the data traffic load instead of using the periodic beaconing strategy. These two strategies together improve the overall performance of the GPSR routing protocol. The performance of the new proposed protocol is evaluated by carrying out several NS-2.35 simulation experiments. The simulation results show that LDAB-GPSR protocol outperforms the GPSR+Predict protocol in terms of packet delivery ratio, control traffic overhead, end to end delay, and throughput. The ratios of enhancement approaches 40%.

Combined oversampling and undersampling method based on slow-start algorithm for imbalanced network traffic

Network traffic data basically comprise a major amount of normal traffic data and a minor amount of attack data. Such an imbalance problem in the amounts of the two types of data reduces prediction performance, such as by prediction bias of the minority data and miscalculation of normal data as outliers. To address the imbalance problem, representative sampling methods include various minority data synthesis models based on oversampling. However, as the oversampling method for resolving the imbalance problem involves repeatedly learning the same data, the classification model can overfit the learning data. Meanwhile, the undersampling methods proposed to address the imbalance problem can cause information loss because they remove data. To improve the performance of these oversampling and undersampling approaches, we propose an oversampling ensemble method based on the slow-start algorithm. The proposed combined oversampling and undersampling method based on the slow-start (COUSS) algorithm is based on the congestion control algorithm of the transmission control protocol. Therefore, an imbalanced dataset oversamples until overfitting occurs, based on a minimally applied undersampling dataset. The simulation results obtained using the KDD99 dataset show that the proposed COUSS method improves the F1 score by 8.639%, 6.858%, 5.003%, and 4.074% compared to synthetic minority oversampling technique (SMOTE), borderline-SMOTE, adaptive synthetic sampling, and generative adversarial network oversampling algorithms, respectively. Therefore, the COUSS method can be perceived as a practical solution in data analysis applications.

Performance Evaluation of TCP Data Transmission in 5G mmWave Networks

Abstract—Fifth generation (5G) networks should use millimeter-wave (mmWave) frequencies to provide high data transmission rate. However, the performance of such networks significantly suffers from the Transmission Control Protocol (TCP) used by various applications for data transmission. In this article, it is shown that the data download rate in 5G networks is much lower than the capacity of the mmWave link because of the Slow Start algorithm used in the TCP. We analyze various approaches to the problem and propose to use the xStream platform for adjusting TCP parameters. This approach significantly increases the download rate and does not require any changes to the software of client devices, which simplifies the implementation of the proposed approach in real systems.

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.

Stateful-TCP—A New Approach to Accelerate TCP Slow-Start

The Transmission Control Protocol (TCP) is one of the pillars of the Internet. Therefore extensive research has been conducted to improve its performance, primarily via optimizing TCP's congestion control algorithm. In this work, we show that besides congestion control, TCP's Slow-Start algorithm is increasingly becoming a bottleneck in modern high-speed networks. To tackle the problem, we propose a different approach called Stateful-TCP, where path bandwidth estimated in a previous flow is used to instantly ramp up the transmission rate of the subsequent flow to the same destination. This eliminates the need for bandwidth probing in conventional Slow-Start, enabling TCP to efficiently utilize the available path bandwidth right from the beginning. We applied Stateful-TCP to Linux's default TCP implementation - Cubic, to form S-Cubic and evaluated its performance via extensive emulations and Internet experiments. Results from independent Internet experiments using over 1,000 end-user clients showed that S-Cubic could reduce FCT by 37.5% and increase throughput by over 50% compared to Cubic. As opposed to an entirely new TCP design, Stateful-TCP is designed to complement congestion control and thus could potentially be applied to many of the existing TCP variants, as well as incorporated into future TCP designs.

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.

Dynamic TCP-Vegas based on cuckoo search for efficient congestion control for MANET

In the internet congestion control, transmission control protocol (TCP)-Vegas is a source algorithm that provides better performance. However, it has two main issues: first one is rerouting and unable to identify updation of round-trip time (RTT) when changes occurred in the network, these two problems leads to affects the performance of Vegas. These drawbacks persist mostly in the Vegas estimation process of the propagation delay, i.e. BaseRTT. In this paper, we proposed a novel algorithm that uses the cuckoo search optimisation algorithm for selecting the optimal value of BaseRTT. Also, our proposed algorithm has dynamically considered slow start algorithm based on the estimation in real time, the available bandwidth and adjust decrease/ increase rate in congestion avoidance phase for a particular network environment. Simulation results have shown that our proposed algorithm can effectively avoid packet losses and attain the maximum throughput when compared with existing algorithms.

A TCP performance enhancement scheme in infrastructure based vehicular networks

Transmission Control Protocol (TCP) in infrastructure based vehicular networks is dedicated to support reliable Internet services for mobile users. However, an end-toend TCP flow not only experiences some common challenges in wireless mobile networks, such as high packet loss rate, medium access competition, unstable wireless bandwidth, and dynamic topology, etc., but also suffers from performance degradation due to traffic congestion at the Road-Side Units (RSUs) that connect the wireline and wireless networks. In order to address the challenging issues related to reliable TCP transmissions in infrastructure based vehicular networks, we propose an RSU based TCP (R-TCP) scheme. For wireline source nodes, R-TCP adopts a novel flow control mechanism to adjust transmission rates according to the status of bottleneck link. Specifically, during the short wireless connection time in Infrastructure based vehicular networks, R-TCP quickly chooses an ideal transmission rate for data transmissions instead of activating the slow start algorithm after the connection is established, and successfully avoids the oscillation of the transmission rate. Simulation results show that R-TCP achieves great advantages than some relate proposals in terms of throughput, end-to-end delay, and packet loss rate.

Novel Slow Start Algorithm

Internet has developed into dynamic network where users use wired/wireless access technologies. The diversity of bandwidths, delays and error rates observed on Internet have increased. TCP is the common denominator for many services therefore by modifying TCP the need for applying solutions locally can be reduced. We focus on making TCP more efficient in a way to speed up its slow start phase. Different Slow Start algorithms will be analyzed and new variant will be proposed.

A Logarithmic Slow-Start Algorithm of TCP Vegas in IP Networks

In numerous TCP congestion control algorithms, TCP Vegas avoids congestion on its own initiative. However, its slow-start ending quickly and growing unsmoothly cause that the congestin window designing too small and bandwidth utilization declining too rapid, furthermore affect network efficiency and throughput dropping...etc. Aimed at the deficiencies, we propose a kind of Loga- rithmic Slow-Start Algorithm of TCP Vegas (LSSA-TCP Vegas) to conduct the dynamics of congestion window. We analyze stability condition from the theory via the Nyquist stability criterion and study the issue such as convergence of the algorithm, configuration parameters. Our goal in this paper is to study and compare the performance of LSSA-TCP Vegas and other TCP congestion control algorithms under various network scenarios. The simulation results demonstrate that the algorithm vs the bug of TCP Vegas contains obvious improvements. We believe that Logarithmic Slow-Start Algorithm can be used to provide the better performance of TCP Vegas.

QTCP: Improving Throughput Performance Evaluation with High-Speed Networks

High-speed TCP (HSTCP) is one of the several popular variants of TCP aimed at the optimization of TCP for high-speed networks. Like all other variants, HSTCP also fails to take full shared bandwidth utilization and offers low throughput rate, high packet loss rate and poor fairness. To overcome these problems, a new adaptive congestion control algorithm with high-speed delay product network named, the Quick Transport Control Protocol (QTCP) has been designed through this research. The basic idea of QTCP has been inspired by the HSTCP and CUBIC, which supported to enhance the algorithm. Three main component of QTCP window control algorithm are α phase, β phase and multiplicative decrease. An experimental setup was designed for the evaluation of QTCP. In this experiment, the QTCP was evaluated based on average throughput and fairness between multiple flows with the same RTT. QTCP performs tuning of the sender side modification based on slow start and AIMD algorithms of HSTCP and CUBIC. QTCP provides higher throughput and enhanced fairness as compared to most of the currently available TCP variants for high-speed networks. The improved throughput and fairness remains intact even in the presence of background traffic. NS-2 simulator-based results with different configurations are presented, discussed in detail, and evaluated with other popular algorithms.

Asymptotic Stability Analysis of E-speed Start Congestion Control Protocol for TCP

All the proposed window based congestion control protocols use a single slow start algorithm. It has been shown in literature that slow start inefficiently utilizes bandwidth in a network with high bandwidth delay product (BDP). A multiple startup algorithm (E- speed start) was proposed in this work. E-speed start specifies a multiple selectable startup for Transmission Control Protocol (TCP). It is proposed that startup speed for TCP be selectable from n-arry startup algorithms. In E-speed start, a binary start was implemented based on a calculated value β which depends on the available bandwidth and other network conditions. A model for E- speed start was derived using utility maximization theory and the principle of decentralised solution. The model derived was shown to be stable by linear approximation, Laplace transform and by using the concept of Nyquist Stability criterion.

An Application of the Modification of Slow Start Algorithm in Campus Network

For the problems existing in TCP/IP congestion control method, a modified slow start algorithm is introduced to the internal services of campus network to make congestion control method more effective. Network simulation results show that: the modified congestion control algorithm can effectively improve the network transmission efficiency in a specific network environment.

An Application of the Modification of Slow Start Algorithm in Campus Network

For the problems existing in TCP/IP congestion control method, a modified slow start algorithm is introduced to the internal services of campus network to make congestion control method more effective. Network simulation results show that: the modified congestion control algorithm can effectively improve the network transmission efficiency in a specific network environment.

Taming the elephants: New TCP slow start

Standard slow start does not work well under large bandwidth-delay product (BDP) networks. We find two reasons for this problem in three popular existing operating systems: Linux, FreeBSD and Windows XP. The first reason is that heavy packet losses occur because of the exponential increase of the congestion window during standard slow start. Recovering from heavy packet losses puts extremely high loads on end systems, rendering the end systems completely unresponsive for a long period of time, and results in a long blackout period without transmission. This problem commonly occurs with all three operating systems. The second reason is that some proprietary protocol optimizations applied to slow start happen to slow down the loss recovery followed by slow start. Although improving the system bottleneck by optimizing data structures is valuable especially for addressing the processing overload with heavy packet losses, it is not effective for the prolonged loss recovery caused by proprietary optimizations. In addition, a large number of packet losses are not desirable since they waste network bandwidth and lead TCP into frequent timeouts and loss synchronization which results in under-utilization of the network. We propose a new slow start algorithm, called Hybrid Start (HyStart), that finds a “safe” exit point for slow start at which it can terminate and safely advance to the congestion avoidance phase without causing heavy packet loss. HyStart uses ACK trains and RTT delay samples to detect whether (1) the forward path is congested or (2) the current size of the congestion window has reached the available capacity of the forward path. HyStart is a plugin to TCP senders and requires no change on TCP receivers. We implement HyStart for TCP-NewReno and TCP-SACK in Linux and compare its performance with five different slow start schemes on the TCP receivers of the three different operating systems on the Internet and also in lab testbeds. Our results indicate that HyStart works consistently well under diverse network environments, including asymmetric links, wireless networks, and high and low BDP networks. Especially with different operating system receivers (Windows XP and FreeBSD), HyStart improves the start-up throughput of TCP significantly by more than 2 to 3 times and is the default slow start algorithm of CUBIC since Linux 2.6.29.

Comparison of end-to-end and network-supported fast startup congestion control schemes

A fundamental challenge for congestion control is the flow startup phase after the connection setup or after long idle periods. The Transmission Control Protocol (TCP) uses the time-consuming Slow-Start mechanism in that case. The objective of fast startup congestion control is to fully utilize a path much more rapidly. Faster startups can either be realized by new end-to-end congestion control mechanisms that change the Slow-Start algorithm, or by additional on-path signaling providing information about the path. This paper comprehensively compares end-to-end and network-supported fast startup schemes. We evaluate both the potential performance benefit and risk, using analytical models, simulation results, and experiments with real applications. Concerning end-to-end schemes, we study both a simple increase of the initial congestion window and the recently proposed Jump-Start mechanism. The considered network-supported schemes are the Quick-Start TCP extension and the Rate Control Protocol (RCP). They can all significantly reduce the transport delay of mid-sized data transfers, in particular over broadband networks with a non-negligible latency. As a result, fast startup schemes can significantly speed up Internet application with such traffic patterns. Our results also reveal that end-to-end approaches are not necessarily overly aggressive. Network-supported mechanisms can reduce the risk of congestion, but there are several unsolved open issues. In summary, we argue that end-to-end fast startup schemes such as an increased initial congestion window would be a promising solution for the Internet.