FAST TCP: Motivation, Architecture, Algorithms, Performance

We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness

Active Queue Management for Fair Resource Allocation in Wireless Networks

This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users

Design of Feedback Controls Supporting TCP Based on the State–Space Approach

This paper investigates how to design feedback controls supporting transmission control protocol (TCP) based on the state-space approach for the linearized system of the well-known additive increase multiplicative decrease (AIMD) dynamic model. We formulate the feedback control design problem as state-space models without assuming its structure in advance. Thereby, we get three results that have not been observed by previous studies on the congestion control problem. 1) In order to fully support TCP, we need a proportional-derivative (PD)-type state-feedback control structure in terms of queue length (or RTT: round trip time). This backs up the conjecture in the networking literature that the AQM RED is not enough to control TCP dynamic behavior, where RED can be classified as a P-type AQM (or as an output feedback control for the linearized AIMD model). 2) In order to fully support TCP in the presence of delays, we derive delay-dependent feedback control structures to compensate for delays explicitly under the assumption that RTT, capacity and number of sources are known, where all existing AQMs including RED, REM/PI and AVQ are delay-independent controls. 3) In an attempt to interpret different AQM structures in a unified manner rather than to compare them via simulations, we propose a PID-type mathematical framework using integral control action. As a performance index to measure the deviation of the closed-loop system from an equilibrium point, we use a linear quadratic (LQ) cost of the transients of state and control variables such as queue length, aggregate rate, jitter in the aggregate rate, and congestion measure. Stabilizing gains of the feedback control structures are obtained minimizing the LQ cost. Then, we discuss the impact of the control structure on performance using the PID-type mathematical framework. All results are extended to the case of multiple links and heterogeneous delays

Equilibrium of Heterogeneous Congestion Control: Optimality and Stability

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the current theory based on utility maximization fails to predict the network behavior. The pricing signals can be different types of signals such as packet loss, queueing delay, etc, or different values of the same type of signal such as different ECN marking values based on the same actual link congestion level. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, suboptimal and unstable. In Tang et al. (“Equilibrium of heterogeneous congestion control: Existence and uniqueness,” IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 824–837, Aug. 2007), existence and uniqueness of equilibrium of heterogeneous protocols are investigated. This paper extends the study with two objectives: analyzing the optimality and stability of such networks and designing control schemes to improve those properties. First, we demonstrate the intricate behavior of a heterogeneous network through simulations and present a framework to help understand its equilibrium properties. Second, we propose a simple source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns by only updating a linear parameter in the sources’ algorithms on a slow timescale. It steers a network to the unique optimal equilibrium. The scheme can be deployed incrementally as the existing protocol needs no change and only new protocols need to adopt the slow timescale adaptation