An empirical validation of a duality model of TCP and queue management algorithms
In this paper we validate through simulations a duality model of TCP and active queue management (AQM) proposed earlier. In this model, TCP and AQM are modeled as carrying out a distributed primal-dual algorithm over the Internet to maximize aggregate source utility. TCP congestion avoidance algorithms, such as Reno and Vegas, iterate on source rates, the primal variable. AQM algorithms, such as RED and REM, iterate on marking probability, the dual variable.
© Copyright 2001 IEEE. Reprinted with permission. Publication Date: 9-12 Dec. 2001. This work is supported by the Australian Research Council under grant A49930405, the Caltech Lee Center for Advanced Networking, and the Yuen Research Fund.
Published - ATHwsc01.pdf