A Conservative Selective Acknowledgment -based Loss Recovery Algorithm for TCP
RFC 3517, “A Conservative Selective Acknowledgment -based Loss Recovery Algorithm for TCP”, is a Proposed Standard document published in April 2003 by E. Blanton, M. Allman, K. Fall, L. Wang. It has been obsoleted by RFC 6675 — refer to the newer document for the authoritative version. 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 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. [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 3517 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 3516 IMAP4 Binary Content Extension
- RFC 3518 Point-to-Point Protocol Bridging Control Protocol
- RFC 3515 The Session Initiation Protocol Refer Method
- RFC 3519 Mobile IP Traversal of Network Address Translation Devices
- RFC 3514 The Security Flag in the IPv4 Header
- RFC 3520 Session Authorization Policy Element
- RFC 3513 Internet Protocol Version 6 Addressing Architecture
- RFC 3521 Framework for Session Set-up with Media Authorization