The TCP minimum RTO revisited

Authors:
Ioannis Psaras;Vassilis Tsaoussidis
Affiliations:
Dept. of Electrical and Computer Engineering, Demokritos University of Thrace, Xanthi, Greece;Dept. of Electrical and Computer Engineering, Demokritos University of Thrace, Xanthi, Greece
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 6
Cited 2

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
On estimating end-to-end network path properties

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Congestion Control in Linux TCP

Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
Measuring interactions between transport protocols and middleboxes

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Measuring the evolution of transport protocols in the internet

ACM SIGCOMM Computer Communication Review
Why TCP timers (still) don't work well

Computer Networks: The International Journal of Computer and Telecommunications Networking

Safe and effective fine-grained TCP retransmissions for datacenter communication

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Exploiting the potential of DTN for energy-efficient internetworking

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We re-examine the two reasons for the conservative 1-second Minimum TCP-RTO to protect against spurious timeouts: i) the OS clock granularity and ii) the Delayed ACKs. We find that reason (i) is canceled in modern OSs; we carefully design a mechanism to deal with reason (ii). Simulation results show that in next generation's high-speed, wireless-access networks, TCP-RTO should not be limited by a fixed, conservative lower bound.