Published January 1, 2002 | Version Submitted
Technical Report Open

Cost of AQM in stabilizing TCP

Abstract

In this paper, we propose a unified mathematical framework based on receding horizon control for analyzing and designing AQM (Active Queue Management) algorithms in stabilizing TCP (Transfer Control Protocol). The proposed framework is based on a dynamical system of the given TCP and a linear quadratic cost on transients in queue length and flow rates. We derive the optimal receding horizon AQMs (RHAs) that stabilizes the linearized dynamical system with the minimum cost. Conversely, we show that any AQM with an appropriate structure solves the same optimal control problem with appropriate weighting matrix. We interpret existing AQM's such as RED, REM, PI and AVQ as different approximations of the optimal AQM, and discuss the impact of these approximations on performance.

Additional Information

© 2002 California Institute of Technology. The first author acknowledges the support of the Post-doctoral Fellowship Program of Korean Science & Engineering Foundation (KOSEF). We would like to thank to Sanjeewa Athuraliya for his help of NS-simulation.

Attached Files

Submitted - 008final.pdf

Files

008final.pdf

Files (494.7 kB)

Name Size Download all
md5:ed46a1fe9650f603fb5076fbb927c171
494.7 kB Preview Download

Additional details

Identifiers

Eprint ID
26933
DOI
10.7907/Z9JM27M3
Resolver ID
CaltechCSTR:2002.008

Funding

Korean Science and Engineering Foundation

Dates

Created
2002-07-17
Created from EPrint's datestamp field
Updated
2023-02-07
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Computer Science Technical Reports
Series Name
Computer Science Technical Reports