On designing improved controllers for AQM routers supporting TCP flows
Published 13 November 2002Open access
C.V. Hollot, Vishal Misra, Don Towsley, Weibo Gong
Citations959
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A previously developed linearized model of TCP and active queue management (AQM) is studied, and the proportional integral (PI) controller is shown to outperform RED significantly.
Abstract
In this paper we study a previously developed linearized model of TCP and active queue management (AQM). We use classical control system techniques to develop controllers well suited for the application. The controllers are shown to have better theoretical properties than the well known RED controller. We present guidelines for designing stable controllers subject to network parameters like load level propagation delay etc. We also present simple implementation techniques which require a minimal change to RED implementations. The performance of the controllers are verified and compared with RED using ns simulations. The second of our designs, the proportional integral (PI) controller is shown to outperform RED significantly.
Keywords
Computer ScienceBusiness, Management and Accounting
IEEE/ACM Transactions on NetworkingRandom early detection gateways for congestion avoidance
6,255 Citations1993Sally Floyd, Van Jacobson
Red gateways are designed to accompany a transport-layer congestion control protocol such as TCP and have no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time.
Journal of the Operational Research SocietyRate control for communication networks: shadow prices, proportional fairness and stability
5,023 Citations1998F. P. Kelly, A.K. Maulloo +1 more
This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Essentials of Robust Control
3,840 Citations1997Kemin Zhou, John C. Doyle
AutomaticaComputer controlled systems theory and design
3,014 Citations1986
This volume focuses on the design of computer-controlled systems, featuring computational tools that can be applied directly and are explained with simple paper-and-pencil calculations.
IEEE/ACM Transactions on NetworkingOptimization flow control. I. Basic algorithm and convergence
1,975 Citations1999Steven H. Low, D.E. Lapsely
An optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates to solve the dual problem using a gradient projection algorithm.
ACM SIGCOMM Computer Communication ReviewThe macroscopic behavior of the TCP congestion avoidance algorithm
1,497 Citations1997Matthew Mathis, Jeffrey Semke +2 more
A performance model for the TCP Congestion Avoidance algorithm that predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion is analyzed.
ACM SIGCOMM Computer Communication ReviewFluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
1,280 Citations2000Vishal Misra, Weibo Gong +1 more
A control theoretic analysis of RED
923 Citations2002C.V. Hollot, Vishal Misra +2 more
This work uses a previously developed nonlinear dynamic model of TCP to analyze and design active queue management (AQM) control systems using random early detection (RED) and presents guidelines for designing linearly stable systems subject to network parameters like propagation delay and load level.
Dynamics of random early detection
794 Citations1997Dong Lin, Robert Morris
Fair Random Early Drop (FRED), a modified version of RED that uses per-active-flow accounting to impose on each flow a loss rate that depends on the flow's buffer use, is proposed and shown that FRED provides better protection than RED for adaptive flows.
A Proposal to add Explicit Congestion Notification (ECN) to IP
736 Citations1999K. K. Ramakrishnan, Sally Floyd
This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP, and describes what modifications would be needed to TCP to make it ECN-capable.
SRED: stabilized RED
674 Citations1999Teunis J. Ott, T. V. Lakshman +1 more
It is shown that candidate rows thus identified indeed have a high posterior probability of taking a larger than average amount of bandwidth, and the mechanism can be used to identify flows that may be misbehaving.
AutomaticaResource pricing and the evolution of congestion control
550 Citations1999Richard Gibbens, F. P. Kelly
By appropriately marking packets at overloaded resources and by charging a fixed small amount for each mark received, end-nodes are provided with the necessary information and the correct incentive to use the network efficiently.
A self-configuring RED gateway
510 Citations1999Wei Feng, D.D. Kandlur +2 more
This paper shows that the effectiveness of RED depends, to a large extent, on the appropriate parameterization of the RED queue, and proposes and experiments with more adaptive RED gateways which self-parameterize themselves based on the traffic mix.
A study of active queue management for congestion control
411 Citations2002Victor Firoiu, M. Borden
This work first study the current proposals for RED implementation and identifies several structural problems such as producing large traffic oscillations and introducing unnecessary overhead in the fast path forwarding.
BLUE: A New Class of Active Queue Management Algorithms
301 Citations1999Wu-chang Fengy, Dilip D. Kandlurz +2 more
Stochastic Fair BLUE is proposed and evaluated, a queue management algorithm which can identify and rate-limit non-responsive flows using a very small amount of state information and a novel technique for enforcing fairness among a large number of flows.
ACM SIGCOMM Computer Communication ReviewTuning RED for Web traffic
202 Citations2000Mikkel Christiansen, Kevin Jeffay +2 more
A time scale decomposition approach to adaptive ECN marking
123 Citations2002S.S. Kunniyur, R. Srikant
This paper examines the question of providing feedback from the network such that the congestion controllers derived from the penalty function formulation lead to the solution of the original unconstrained problem and results in two separate systems which are stable individually.
Influence of Active Queue Management Parameters on Aggregate Traffic Performance
44 Citations2000Martin May, Christophe Diot +2 more
It is shown that if TD and RED have similar behaviors in terms of aggregate TCP throughput, RED discards more non responsive traffic than TD and that RED creates more consecutive drops than TD.