IETF RFC 6675
A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP
active, Most Current
Buy Now
| Organization: | IETF |
| Publication Date: | 1 August 2012 |
| Status: | active |
| Page Count: | 15 |
scope:
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.
Document History
IETF RFC 6675
August 1, 2012
A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP
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...