A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An empirical validation of a duality model of TCP and queue management algorithms
Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304)
Preserved Fulltext
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.
doi:10.1109/wsc.2001.977445
dblp:conf/wsc/AthuraliyaL01
fatcat:lopf4ctkzzgphfjdrgrgo7f3o4