Understanding TCP Vegas
Top Cited Papers
- 1 March 2002
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 49 (2) , 207-235
- https://doi.org/10.1145/506147.506152
Abstract
We view congestion control as a distributed primal--dual algorithm carried out by sources and links over a network to solve a global optimization problem. We describe a multilink multisource model of the TCP Vegas congestion control mechanism. The model provides a fundamental understanding of delay, fairness and loss properties of TCP Vegas. It implies that Vegas stabilizes around a weighted proportionally fair allocation of network capacity when there is sufficient buffering in the network. It clarifies the mechanism through which persistent congestion may arise and its consequences, and suggests how we might use REM active queue management to prevent it. We present simulation results that validate our conclusions.Keywords
This publication has 13 references indexed in Scilit:
- REM: active queue managementIEEE Network, 2001
- Stability and performance analysis of networks supporting elastic servicesIEEE/ACM Transactions on Networking, 2001
- Optimization flow control with Newton‐like algorithmTelecommunication Systems, 2000
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- The performance of TCP/IP for networks with high bandwidth-delay products and random lossIEEE/ACM Transactions on Networking, 1997
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- TCP Vegas: end to end congestion avoidance on a global InternetIEEE Journal on Selected Areas in Communications, 1995
- TCP and explicit congestion notificationACM SIGCOMM Computer Communication Review, 1994
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Connections with multiple congested gateways in packet-switched networks part 1ACM SIGCOMM Computer Communication Review, 1991