Skip to main content
Conference ProceedingsOPEN ACCESS

The TCP minimum RTO revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4479 LNCS 981-991
DOI: 10.1007/978-3-540-72606-7_84
8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IFIP International Federation for Information Processing 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Psaras, I., & Tsaoussidis, V. (2007). The TCP minimum RTO revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 981–991). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free