AdaVegas: Adaptive Control for TCP Vegas
Abstract:
Abstract--- In this paper we introduce AdaVegas, an adaptive congestion control mechanism based on TCP Vegas. TCP Vegas has several parameters which control the way it increases the sending rate. While TCP Vegas holds theses parameters constant, AdaVegas sets these values dynamically. In this way AdaVegas is able to change its increment strategy dynamically and better adapt to the current environment. Using simulations we both evaluate AdaVegas and compare it to TCP Vegas. Our simulations show that AdaVegas achieves significantly better results than TCP Vegas with a fairly low overhead. I.
Citations
| 1790 | Congestion avoidance and control – Jacobson - 1988 |
| 548 | Markov decision processes : discrete stochastic dynamic programming – Puterman - 1994 |
| 395 | TCP vegas: New techniques for congestion detection and avoidance – Brakmo, O'Malley, et al. |
| 384 | Analysis of the increase and decrease algorithms for congestion avoidance in computer networks – CHIU, JAIN - 1989 |
| 165 | TCP-friendly unicast rate-based flow control.” Technical note sent to the end2end-interest mailing list – Mahdavi, Floyd - 1997 |
| 132 | Binomial Congestion Control Algorithms – Bansal, Balakrishnan - 2001 |
| 73 | General AIMD Congestion Control – Yang, Lam - 2000 |
| 40 | On improving fairness of TCP congestion avoidance – Henderson, Sahouria, et al. |

