RFC 4138: Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP and the Stream Control Transmission Protocol (SCTP)
In plain English — editorial summary, not part of the RFC
Spurious retransmission timeouts cause suboptimal TCP performance because they often result in unnecessary retransmission of the last window of data. This document describes the F-RTO detection algorithm for detecting spurious TCP retransmission timeouts. F-RTO is a TCP sender-only algorithm that does not require any TCP options to operate. After retransmitting the first unacknowledged segment triggered by a timeout, the F-RTO algorithm of the TCP sender monitors the incoming acknowledgments to determine whether the timeout was spurious. It then decides whether to send new segments or retransmit unacknowledged segments. The algorithm effectively helps to avoid additional unnecessary retransmissions and thereby improves TCP performance in the case of a spurious timeout. The F-RTO algorithm can also be applied to the Stream Control Transmission Protocol (SCTP). This memo defines an Experimental Protocol for the Internet community.
Document record
- Document ID
- RFC4138
- Published
- August 2005
- Authors
- P. Sarolahti; M. Kojo
- Status
- EXPERIMENTAL
- Stream
- IETF
- Area
- wit
- Pages
- 23
- Also known as
- —
- Updated by:
- RFC 5682
Topics
Referenced by
One later RFC formally updates or obsoletes part of this document.
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 3782The NewReno Modification to TCP's Fast Recovery AlgorithmObsoleted
April 2004
- RFC 3742Limited Slow-Start for TCP with Large Congestion WindowsCurrent
March 2004
- RFC 3649HighSpeed TCP for Large Congestion WindowsCurrent
December 2003
- RFC 3540Robust Explicit Congestion Notification (ECN) Signaling with NoncesCurrent
June 2003
- RFC 3522The Eifel Detection Algorithm for TCPCurrent
April 2003
- RFC 3517A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCPObsoleted
April 2003
- RFC 3390Increasing TCP's Initial WindowCurrent
November 2002
- RFC 3042Enhancing TCP's Loss Recovery Using Limited TransmitCurrent
January 2001
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?