On improving the fairness of TCP congestion avoidance
- 27 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 539-544
- https://doi.org/10.1109/glocom.1998.775786
Abstract
We report on a simulation-based study ofthe efficacy of modified congestion avoidance algorithmson TCP fairness. We first examined whether a changeto that algorithm, as proposed by Floyd, that resultsin a "Constant-Rate" additive increase policy can correctthe bias against connections with long round triptimes (RTTs). Our first main result is that although theConstant-Rate policy can improve fairness dramatically,we found it difficult to successfully implement such apolicy in a...Keywords
This publication has 9 references indexed in Scilit:
- Design considerations for supporting TCP with per-flow queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The performance of TCP/IP for networks with high bandwidth-delay products and random lossIEEE/ACM Transactions on Networking, 1997
- TCP Selective Acknowledgment OptionsPublished by RFC Editor ,1996
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- TCP Extensions for High PerformancePublished by RFC Editor ,1992
- Connections with multiple congested gateways in packet-switched networks part 1ACM SIGCOMM Computer Communication Review, 1991
- Random drop congestion controlPublished by Association for Computing Machinery (ACM) ,1990
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988