RFC 6675: 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…

Read RFC 6675 on the RFC Editor

Outgoing relationships (8 related RFCs)

Obsoletes, Informative reference — RFC 3517: A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
Normative reference — RFC 2119: Key words for use in RFCs to Indicate Requirement Levels
Normative reference — RFC 793: Transmission Control Protocol
Normative reference — RFC 5681: TCP Congestion Control
Informative reference — RFC 2914: Congestion Control Principles
Informative reference — RFC 6298: Computing TCP's Retransmission Timer
Informative reference — RFC 5961: Improving TCP's Robustness to Blind In-Window Attacks
Informative reference — RFC 6582: The NewReno Modification to TCP's Fast Recovery Algorithm

Incoming relationships (9 related RFCs)

Normatively referenced by — RFC 7414: A Roadmap for Transmission Control Protocol (TCP) Specification Documents
Normatively referenced by — RFC 8312: CUBIC for Fast Long-Distance Networks
Normatively referenced by — RFC 7661: Updating TCP to Support Rate-Limited Traffic
Normatively referenced by — RFC 9438: CUBIC for Fast and Long-Distance Networks
Normatively referenced by — RFC 6937: Proportional Rate Reduction for TCP
Normatively referenced by — RFC 9937: Proportional Rate Reduction (PRR)
Informatively referenced by — RFC 9331: The Explicit Congestion Notification (ECN) Protocol for Low Latency, Low Loss, and Scalable Throughput (L4S)
Informatively referenced by — RFC 8961: Requirements for Time-Based Loss Detection
Informatively referenced by — RFC 9959: Careful Resume: Convergence of Congestion Control from Retained State