A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment for TCP
RFC 6675, “A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment for TCP”, is a Proposed Standard document published in August 2012 by E. Blanton, M. Allman, L. Wang, I. Jarvinen, M. Kojo, Y. Nishida. It obsoletes RFC 3517. The canonical text is published by the RFC Editor.
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]
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 6675 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 6674 Gateway-Initiated Dual-Stack Lite Deployment
- RFC 6676 Multicast Addresses for Documentation
- RFC 6673 Round-Trip Packet Loss Metrics
- RFC 6677 Channel-Binding Support for Extensible Authentication Protocol Methods
- RFC 6672 DNAME Redirection in the DNS
- RFC 6678 Requirements for a Tunnel-Based Extensible Authentication Protocol Method
- RFC 6671 Allocation of a Generic Associated Channel Type for ITU-T MPLS Transport Profile Operation, Maintenance, and Administration
- RFC 6679 Explicit Congestion Notification for RTP over UDP