RFC 2883: An Extension to the Selective Acknowledgement (SACK) Option for TCP
In plain English — editorial summary, not part of the RFC
This note defines an extension of the Selective Acknowledgement (SACK) Option for TCP. [STANDARDS-TRACK]
Document record
- Document ID
- RFC2883
- Published
- July 2000
- Authors
- S. Floyd; J. Mahdavi; M. Mathis; M. Podolsky
- Status
- PROPOSED STANDARD
- Stream
- IETF
- Area
- wit
- Pages
- 17
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 2861TCP Congestion Window ValidationObsoleted
June 2000
- RFC 2988Computing TCP's Retransmission TimerObsoleted
November 2000
- RFC 3042Enhancing TCP's Loss Recovery Using Limited TransmitCurrent
January 2001
- RFC 3390Increasing TCP's Initial WindowCurrent
November 2002
- RFC 3517A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCPObsoleted
April 2003
- RFC 3522The Eifel Detection Algorithm for TCPCurrent
April 2003
- RFC 3540Robust Explicit Congestion Notification (ECN) Signaling with NoncesCurrent
June 2003
- RFC 3649HighSpeed TCP for Large Congestion WindowsCurrent
December 2003
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?