RFC 6675
A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP, August 2012
- File formats:
- Status:
- PROPOSED STANDARD
- Obsoletes:
- RFC 3517
- Authors:
- E. Blanton
M. Allman
L. Wang
I. Jarvinen
M. Kojo
Y. Nishida - Stream:
- IETF
- Source:
- tcpm (wit)
Cite this RFC: TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC6675
Discuss this RFC: Send questions or comments to the mailing list tcpm@ietf.org
Other actions: Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 6675
Abstract
This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it. [STANDARDS-TRACK]
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.