Fluid models: an empirical validation of a duality model of tcp and queue management algorithms

Authors:
Sanjeewa Athuraliya;Steven H. Low
Affiliations:
California Institute of Technology, Pasadena, CA;California Institute of Technology, Pasadena, CA
Venue:
Proceedings of the 33nd conference on Winter simulation
Year:
2001

Citing 10
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
TCP/IP illustrated (vol. 1): the protocols

TCP/IP illustrated (vol. 1): the protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss

IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Understanding TCP vegas: a duality model

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
TCP Vegas: end to end congestion avoidance on a global Internet

IEEE Journal on Selected Areas in Communications
REM: active queue management

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.