Transmission Control Protocol Flows Research Articles

A robust PID and RLS controller for TCP/AQM system

Transmission Control Protocol (TCP) controlling congestion by peer-to-peer is challenging to handle communication with numerous concurrent TCP flows and heavy traffic loads. Therefore, TCP requires the active queue management (AQM) to assist in avoiding buffer bloat in intermediate devices. Thus, Some AQM controllers, such as Red, Codel, and Pie, have been proposed to control congestion better. However, these controllers are unable to overcome the drawbacks, including micro-burst streams, unfair competition of flows with different workloads, as well as sluggishly responding to congestion in heavy traffic, which degrade the performance of data transmission. To address these problems, in this paper, we proposed a queueing-delay-based AQM controller for TCP/AQM systems, namely PID-R. PID-R adopts two-level control components, i.e., the Proportional-Integral-Derivative (PID) algorithm and the recursive least squares (RLS) filter, and combines the advantages of the two parts. Meanwhile, we also constructed a new TCP/PID-R fluid model derived from TCP/AQM classical model. According to the model, PID-R parameters are determined to keep the TCP/PID-R system steady. The comprehensive simulation reveals that PID-R outperforms the state-of-the-art AQM controllers.

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.

Effective TCP Flow Management Based on Hierarchical Feedback Learning in Complex Data Center Network.

Many studies focusing on improving Transmission Control Protocol (TCP) flow control realize a more effective use of bandwidth in data center networks. They are excellent ways to more effectively use the bandwidth between clients and back-end servers. However, these schemes cannot achieve the total optimization of bandwidth use for data center networks as they do not take into account the path design of TCP flows against a hierarchical complex structure of data center networks. To address this issue, this paper proposes a TCP flow management scheme specified a hierarchical complex data center network for effective bandwidth use. The proposed scheme dynamically controls the paths of TCP flows by reinforcement learning based on a hierarchical feedback model, which obtains an optimal TCP flow establishment policy even if both the network topology and link states are more complicated. In evaluation, the proposed scheme achieved more effective bandwidth use and reduced the probability of TCP incast up to 30% than the conventional TCP flow management schemes: Variant Load Balancing (VLB), Equal Cost Multi Path (ECMP), and Intelligent Forwarding Strategy Based on Reinforcement Learning (IFS-RL) in the complex data center network.

Quality of service aware adaptive target queue length generation for active queue management

Active queue management techniques have been proposed to mitigate serious congestion issues caused by transmission control protocol flows. Active queue management controllers based on control theory are superior in terms of control performance. Such a controller utilizes a target queue length as a control input, and the congestion control system attempts to maintain the actual queue length close to the target value. However, the specific setting of the target queue length has not been discussed sufficiently. For example, raising or lowering the target queue length may increase goodput or reduce queueing delay, respectively. Therefore, the target queue length should be appropriately generated according to the required quality of services and buffer status. This paper proposes a quality of services–aware adaptive target queue length generation algorithm for an active queue management controller based on control theory. The proposed algorithm comprises two modes (loss-aware and delay-aware modes) and attempts to raise or lower the target queue length by considering the buffer status to increase the goodput or reduce the queueing delay. Simulation results revealed that the proposed algorithm could increase goodput or reduce queueing delay on each mode by adapting to the buffer status, which is in contrast to conventional methods.

Flow routing aiming load balancing and path length in multi-hop networks with different link qualities

This paper considers an exact bi-objective approach for simultaneously minimizing the total cost of flow routing and the network bottleneck when link qualities and flow weights are relevant. This is useful for wireless multi-hop networks with long-term TCP (Transmission Control Protocol) flows. The introduced proposal can generate a minimal complete set of Pareto-optimal solutions. Our proposal is evaluated through simulation in which are explored different parameter settings and metrics.

Improving The Performance Of Tcp Flows In Wireless Networks By Using Tcp Aware Backpressure And Aodv Algorithms

Wireless sensor networks (WSN’s) are a wireless network consisting of spatially spare out. The wireless sensor network is being deployed in many real-time applications such as environmental monitoring, security, surveillance, industrial automation and control. There are many challenges available in the wireless sensor network. They are Quality of Service (QoS), fault tolerance, scalability and maintainability. Here, choose the Quality of Service to measure the performance of Transmission Control Protocol (TCP) flows. Throughput and fairness are present in the parameter Quality of Service. There are two algorithms are used to measure the throughput and fairness. The first algorithm is TCP aware Backpressure and another one is Ad-hoc On Demand Distance Vector (AODV). Contrast these two algorithms which one is giving a better performance of TCP flows.

Performance analysis of high-speed TCP protocols in LTE X2 handover under realistic operational conditions

Broadband mobile networks have rapidly evolved over the last years. The unique environment they operate, however, sets new challenges for the Transmission Control Protocol (TCP). In this paper, we study the impact of Long Term Evolution (LTE) handover on TCP performance with different TCP congestion control algorithms and in a wide range of networks settings, including different handover types, random channel errors and support of error correction at lower layers. Our results suggest that the congestion control algorithms employed by TCP variants during the LTE X2 handover have different impacts on TCP performance. In particular CUBIC, Scalable TCP and BIC-TCP achieve high goodput and fast window convergence in available channel capacity after LTE X2 handover. In environments involving packet drops that are not corrected at lower layers and single errors with high probability, all TCP variants exhibit very low performance levels. Finally, in terms of fairness, our results identify fairness issues among TCP flows with different Bandwidth Delay Products (BDP), with CUBIC offering the best results.

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

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.

TCP-FLASH - A Fast Reacting TCP for Modern Networks

The Transmission Control Protocol (TCP) plays a critical role in the Internet as it is the protocol used for data transport by most Internet services and applications. With rapid advances in broadband Internet and mobile/wireless networks, current TCPs are increasingly becoming the bottleneck. This work tackles this challenge by developing a novel TCP design called Fast Launch with Agile congeStion Handling (FLASH) that not only achieves improved performance for long TCP flows but also significantly raises the performance of short to medium TCP flows that are far more common in the Internet. We evaluated its long-term and short-term performance over a wide range of network environments, using two emulation platforms (Pantheon and DummyNet) as well as Internet experiments. Compared to two of the leading TCP designs deployed in the Internet, i.e., Cubic and BBR, FLASH consistently achieved higher long-term and short-term bandwidth efficiency. For example, in trace-driven emulated experiments using Poisson traffic with a mean flow size of 1 MB operating at medium link utilization of 27%, FLASH can reduce the flow completion time (FCT) by 36% (vs. Cubic) and 26% (vs. BBR), with mean packet queueing delay of 11.7 ms compared to 3.4 ms (Cubic) and 8.8 ms (BBR). It also maintained good fairness with itself and is competitive against Cubic and BBR sharing the same bottleneck. In addition, FLASH has been tested in two real-world Internet environments. In the cloud-to-cloud experiment, it reduced FCT by 52.9% (vs. Cubic) and 46.6% (vs. BBR), while in the cloud-to-client experiment, it reduced FCT by 31.3% (vs. Cubic) and 12.7% (vs. BBR). FLASH is entirely sender-based and is compatible with current TCP receivers, thereby readily deployable in current Internet servers.

Throughput stability and flow fairness enhancement of TCP traffic in multi-hop wireless networks

In the multi-hop wireless network, transmission control protocol (TCP) throughput stability and flow fairness performances are worsened due to slower flow convergence in the loss recovery phase and flat-rate reduction during the congestion control process. In this article, a combination of network-assisted and window utilization based congestion control approach, known as feedback assisted improved recovery + (FAIR+), is proposed to overcome TCP's limitations under multi-hop wireless networks. The proposed FAIR+ algorithm initiates the congestion control process based on the queue level notification of the relay node and trims down the sending rate based on TCP flow's utilization level. In the congestion recovery phase, the FAIR+ algorithm implements a newer window increment pattern that achieves a faster convergence rate than the existing RFC 6582 implementation. The throughput stability of the FAIR+ algorithm is validated using the duality model and multi-hop wireless simulation. The simulation results convincingly prove that the FAIR+ attains significant improvement in throughput, flow fairness, and end-to-end latency performance over the existing TCP variants (OQS, NRT, and Westwood).

An intelligent long-lived TCP based on real-time traffic regulation

Transmission control protocol (TCP) transaction is one of the chief protocols of Internet protocols. It is divided into two categories of data flow. (1) A small fraction of the TCP connections carried a small portion of the traffic called short-lived TCP. (2) A small fraction of the remaining TCP connections carried a large portion of the traffic called long-lived TCP. The main problem here is the transmission time; other data usually harm its flows, such as User Datagram Protocol (UDP) or short-lived TCP, and cause the unfairness in the network. In this paper, a novel framework is proposed to improve network throughput and to reduce the impact of long-lived TCP to other data flows. In this framework, each TCP connection passed by an edge network device and it will be observed for determining the long-lived TCP flows. Then, the detected long-lived TCP flow will be regulated based on predicting real-time traffic levels. Moreover, to highlight the benefits of the proposed framework, an analytical model is proposed to compare the proposed framework with the conventional TCP in terms of network performance. Experiments are conducted using the ns-2 benchmark in order to verify the results of the analytical model. The results showed that the analytical outcomes are promising and matched well with the outcomes of the ns-2 experiments. In the case of a high error rate, the proposed framework achieves higher reliability and reveals lower resource consumption.

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.

Active Queue Management Supporting TCP Flows Using Disturbance Observer and Smith Predictor

Active queue management (AQM) is a technique to avoid serious congestion of the transmission control protocol (TCP) flows at a router. AQM based on control theory, which utilizes congestion controllers such as proportional-derivative (PD) controller or proportional-integral-derivative (PID) controller, has been previously proposed. In addition, disturbance observer (DOB) has been utilized to compensate for modeling error of a TCP/AQM congestion control system. However, the DOB-based controllers cannot cope with a large time delay in TCP/AQM networks. Although one of the effective time delay compensators is Smith predictor (SP), the implementation of the DOB and SP in an integrated manner has not been accomplished, because of saturation due to the input limit of packet drop probability. In this paper, a novel TCP/AQM congestion control system with the DOB and SP considering the saturation function is proposed to compensate for the modeling error and time delay simultaneously. Simulation results show that the proposed controller provides better throughput and goodput than conventional controllers. One of the simulations assume that the propagation delay and bottleneck link capacity are set to 100 ms and 100 Mbps, respectively. Under this assumption, it is confirmed that the proposed controller achieves a goodput of 99.55 Mbps whereas the classical PID controller and PD controller with DOB achieve 99.23 Mbps and 99.24 Mbps, respectively.

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.

Receiver-Side TCP Countermeasure in Cellular Networks.

Cellular-based networks keep large buffers at base stations to smooth out the bursty data traffic, which has a negative impact on the user’s Quality of Experience (QoE). With the boom of smart vehicles and phones, this has drawn growing attention. For this paper, we first conducted experiments to reveal the large delays, thus long flow completion time (FCT), caused by the large buffer in the cellular networks. Then, a receiver-side transmission control protocol (TCP) countermeasure named Delay-based Flow Control algorithm with Service Differentiation (DFCSD) was proposed to target interactive applications requiring high throughput and low delay in cellular networks by limiting the standing queue size and decreasing the amount of packets that are dropped in the eNodeB in Long Term Evolution (LTE). DFCSD stems from delay-based congestion control algorithms but works at the receiver side to avoid the performance degradation of the delay-based algorithms when competing with loss-based mechanisms. In addition, it is derived based on the TCP fluid model to maximize the network utility. Furthermore, DFCSD also takes service differentiation into consideration based on the size of competing flows to shorten their completion time, thus improving user QoE. Simulation results confirmed that DFCSD is compatible with existing TCP algorithms, significantly reduces the latency of TCP flows, and increases network throughput.

CCID: Cross-Correlation Identity Distinction Method for Detecting Shrew DDoS

This study presents a new method for detecting Shrew DDoS (Distributed Denial of Service) attacks and analyzes the characteristics of the Shrew DDoS attack. Shrew DDoS is periodic to be suitable for the server’s TCP (Transmission Control Protocol) timer. It has lower maximum to bypass peak detection. This periodicity makes it distinguishable from normal data packets. By proposing the CCID (Cross-Correlation Identity Distinction) method to distinguish the flow properties, it quantifies the difference between a normal flow and an attack flow. Simultaneously, we calculated the cross-correlation between the attack flow and the normal flow in three different situations. The server can use its own TCP flow timer to construct a periodic attack flow. The cross-correlation between Gaussian white noise and simulated attack flow is less than 0.3. The cross-correlation between single-door function and simulated attack flow is 0.28. The cross-correlation between actual attack flow and simulated attack flow is more than 0.8. This shows that we can quantitatively distinguish the attack effects of different signals. By testing 4 million data, we can prove that it has a certain effect in practice.

Local Stability and Hopf Bifurcation Analysis for Compound TCP

We conduct a local stability and Hopf bifurcation analysis for Compound transmission control protocol (TCP), with small Drop-Tail buffers, in three topologies. The first topology consists of two sets of TCP flows having different round-trip times and feeding into a core router. The second topology consists of two distinct sets of TCP flows, regulated by a single-edge router and feeding into a core router. The third topology comprises two distinct sets of TCP flows, regulated by two separate edge routers and feeding into a core router. In each case, we conduct a local stability analysis and obtain conditions on the network and protocol parameters to ensure stability. If these conditions get marginally violated, we show that the underlying systems lose local stability via a Hopf bifurcation. After exhibiting a Hopf, a key concern is to determine the asymptotic orbital stability of the bifurcating limit cycles. We then present a detailed analytical framework to address the stability of the limit cycles and the type of the Hopf bifurcation by invoking Poincare normal forms and the center manifold theory. We finally conduct packet-level simulations to corroborate our analytical insights.

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.

Novel Active Queue Management Scheme for Routers in Wireless Networks

Congestion stability and prevention is the main aim of any decent network traffic management scheme. The protocol that drives congestion control in IP networks, called The Transmission Control Protocol (TCP), is plagued by bandwidth underutilization when implemented on wireless networks. The management of network trunk queue size is the goal of this paper, along with its antecedent delay issues with Active Queue Management (AQM) algorithms that overcomes the bandwidth underutilization issue faced by TCP flows in wireless networks. Two adaptive TCP models, specifically built for wireless networks, were created. This made it possible to implement feedback control techniques in the chosen AQM design for queue management. The two AQM policies were created with the help of Model Predictive Control (MPC) and Self-Tuning Control (STC). A very thorough comparison was made between the developed AQM schemes and two Early Detection Controllers, namely, Random Early Detection (RED) and Fixed-Parameter Proportional Integral (PI). Under varying wireless network conditions, the results obtained from simulating the proposed queue management scheme in MATLAB® confirmed that the fixed PI and RED controllers were, by comparison, inferior in performance. Copyright © 2018 Praise Worthy Prize S.r.l. - All rights reserved.

Comparative Performance Evaluation of TCP with Identical and Cross-Variant Congestion Control

The Transmission Control Protocol (TCP), a key functional building block of the Internet, operates as a rate-adaptive end-to-end protocol at the Transport Layer of the network protocol stack. It regulates the prevailing load conditions within the network by getting the source node to adapt the packet transfer rate in accord with the processing capacity of the receiver. The regulation is enforced by means of dropping of packets on the part of the receiver. The TCP sender then reduces the packet injection rate so as to allow the network to recover from congestion. The focus of this paper is performance evaluation of certain notable TCP congestion avoidance algorithms, namely, Vegas, Reno and New Reno. Specifically, a number of performance measures have been analysed based on ns-2 simulation data where the scenarios involved TCP flows operating with identical and cross-variant congestion control mechanisms. Congestion window behaviour, packet loss, throughput, transmission delay and jitter are the performance criteria studied with the setup mentioned. In the flows with identical variants, Vegas outperforms other TCP variants. However, TCP Vegas has been observed to contribute to unfair appropriation of the resources in the cross-variant setting.