Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Investigating the use of synchronized clocks in tcp congestion control
Investigating the use of synchronized clocks in tcp congestion control
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
| Hi-index | 0.00 |
The congestion control mechanism in TCP was first introduced by Jacobson in [7], which was later developed into TCP Tahoe. Since then, various end-to-end congestion control protocols have been proposed, including Reno [2], NewReno [6], SACK [4], and Vegas [3]. Among these protocols, TCP Reno is the standard congestion control algorithm for TCP traffic, according to [2]. However, TCP Reno detects congestion only when a packet loss occurs, i.e., when the sender receives duplicate acknowledgements (ACKs) or experiences a timeout. Hence, there are no explicit congestion notifications to end systems.