3517: A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for

HTML TXT PS PDF

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.

Status PROPOSED STANDARD
Format TXT=27855 bytes
Authors L. Wang K. Fall M. Allman TCP.
Date April 2003
Keyphrases TCP SACK recovery loss recovery

References

RFC793: Transmission Control Protocol.
RFC2018: TCP Selective Acknowledgment Options.
RFC2026: The Internet Standards Process -- Revision 3.
RFC2119: Key words for use in RFCs to Indicate Requirement Levels.
RFC2581: TCP Congestion Control.
RFC2582: The NewReno Modification to TCP's Fast Recovery Algorithm.
RFC2914: Congestion Control Principles.
RFC2988: Computing TCP's Retransmission Timer.
RFC3042: Enhancing TCP's Loss Recovery Using Limited Transmit.

Referenced by

RFC3708: Using TCP Duplicate Selective Acknowledgement (DSACKs) and Stream Control Transmission Protocol (SCTP) Duplicate Transmission Sequence Numbers (TSNs) to Detect Spurious Retransmissions.
RFC3782: The NewReno Modification to TCP's Fast Recovery Algorithm.
RFC4015: The Eifel Response Algorithm for
RFC4138: Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP and the Stream Control Transmission Protocol (SCTP).
RFC4341: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control.
RFC4614: A Roadmap for Transmission Control Protocol (TCP) Specification Documents.
RFC4653: Improving the Robustness of TCP to Non-Congestion Events.