Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A spectrum of TCP-friendly window-based congestion control algorithms
IEEE/ACM Transactions on Networking (TON)
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Hi-index | 0.00 |
In fast long-distance networks, TCP fails to fully utilize the bandwidth due to its congestion control mechanism A plethora of congestion control schemes that may enhance the performance of the transport protocol in fast long-distance networks have been proposed The proposed schemes aim to satisfy three requirements of congestion control schemes: bandwidth scalability, TCP friendliness, and RTT fairness However, due to the trade-off among these requirements, it is difficult to satisfy all the requirements simultaneously In this paper, we propose a new window-based congestion control scheme called EIMD (Exponential Increase/Multiplicative Decrease) that increases congestion window size exponentially to quickly grap the unutilized bandwidth We evaluate the performance of EIMD via computer simulations The simulation results show that EIMD satisfies the three requirements In addition, EIMD converges fast to the fair-share points.