Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Improving round-trip time estimates in reliable transport protocols
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
High-speed networks: TCP/IP and ATM design principles
High-speed networks: TCP/IP and ATM design principles
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The initial TCP Tahoe version uses the slow-start algorithm to deal with flow control and congestion avoidance. The later Reno version deploys both fast-retransmit and fast-recovery algorithms. Traditionally a segment loss is considered as owing to the network congestion. However, a packet loss may be caused by some other reason such as a transmission error in the wireless link. Due to this reason, we design a mechanism that subdivides the congestion control mechanism into two parts, the packet loss indication and the loss recovery. Regarding the former, we no longer treat the packet loss caused by the transmission error as an indication of network congestion. While for the latter, we proposed a modified scoreboard algorithm in TCP FACK to quickly recover the packet loss and prevent the retransmitted packet from being lost again.