Published January 1, 2002 | Submitted
Technical Report Open

Analysis and Design of AQM for stabilizing TCP

An error occurred while generating the citation.

Abstract

In this paper, we propose a unified AQM (Active Queue Management) framework and stabilizing optimal AQMs in stabilizing a given TCP (Transmission Control Protocol) and a real-queue dynamics. Since we formulate the AQM design problem for the given TCP as state-space models, we get three important features. First, we propose a PD-type (Proportional-Derivative) control structure and by applying integral control action technique, a PID-type (Proportional-Integral-Derivative) control structure. Second, we propose memory control structures to compensate explicitly delays in congestion measure by using memory control structures. Third, we propose stabilizing optimal AQMs by minimizing linear quadratic costs on the transients in queue length, aggregate rate, jitter in the aggregate rate, and congestion measure, which are called RHA (Receding Horizon AQM) in this paper. Conversely, we show that any AQM with an appropriate structure solves the same stabilizing optimal control problem with appropriate weighting matrices. Finally, we interpret existing AQMs such as RED (Random Early Detection), REM (Random Exponential Marking), PI (Proportional-Integral) and AVQ as different approximations of the unified AQM structures, and discuss the impact of each structures on performance from the results of the stabilizing optimal AQMs. We illustrate our results through simulation examples for the linearized system of a given nonlinear TCP and queue dynamical system.

Additional Information

© 2002 California Institute of Technology.

Attached Files

Submitted - 009final.pdf

Submitted - 009final.ps

Submitted - cdc_aqm02.bbl

Files

009final.pdf
Files (1.4 MB)
Name Size Download all
md5:058a1568d1266decfd3caf26dfe947d8
530.3 kB Preview Download
md5:a1d7a6d6a0f8b41f83292ef2e97b8766
839.5 kB Download
md5:6408f8ab404c6d795d8a50745585f3c6
5.3 kB Download

Additional details

Created:
August 19, 2023
Modified:
January 29, 2025