RFC 3782: The NewReno Modification to TCP's Fast Recovery Algorithm
This RFC has been replaced. Do not implement against it for new work — it was formally obsoleted by RFC 6582.
Current document in this lineage: RFC 6582 — The NewReno Modification to TCP's Fast Recovery Algorithm
In plain English — editorial summary, not part of the RFC
The purpose of this document is to advance NewReno TCP's Fast Retransmit and Fast Recovery algorithms in RFC 2582 from Experimental to Standards Track status. The main change in this document relative to RFC 2582 is to specify the Careful variant of NewReno's Fast Retransmit and Fast Recovery algorithms. The base algorithm described in RFC 2582 did not attempt to avoid unnecessary multiple Fast Retransmits that can occur after a timeout. However, RFC 2582 also defined "Careful" and "Less Careful" variants that avoid these unnecessary Fast Retransmits, and recommended the Careful variant. This document specifies the previously-named "Careful" variant as the basic version of NewReno TCP. [STANDARDS-TRACK]
Document record
- Document ID
- RFC3782
- Published
- April 2004
- Authors
- S. Floyd; T. Henderson; A. Gurtov
- Status
- PROPOSED STANDARD
- Stream
- IETF
- Area
- wit
- Pages
- 19
- Also known as
- —
Topics
Standards lineage
This document is one revision in a chain of 3 RFCs, each formally replacing the one before it.
- RFC 2582 (1999)
- RFC 3782 (2004)
- RFC 6582 (2012) ✓
Read the full history of The NewReno Modification to TCP's Fast Recovery Algorithm →
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 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 4138Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP and the Stream Control Transmission Protocol (SCTP)Updated
August 2005
- 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?