API Build-data JSON Resources
Theme

Choose how MSRBot.io looks on this device.

Auto (match system) Light mode Dark mode

Preference is stored in this browser only.

IETF RFC 3517
[SUPERSEDED]

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

Metadata

Publisher
IETF
Doc Type
Standard
Pages
13
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]
Publication Date
2003-04-01
Status Note
Proposed Standard
DOI
10.17487/RFC3517
Link
https://doi.org/10.17487/RFC3517
Author(s)
Ethan Blanton
Mark Allman
Kevin Fall
Lili Wang
Keyword(s)
TCP, Retransmission, Congestion Control
Latest version of IETF RFC 3517

Document Versions — IETF RFC 3517

  • ▶ IETF RFC 3517 (2003-04-01)
    THIS DOC [SUPERSEDED] [LATEST VERSION]

Superseded by:
  • RFC6675 — RFC6675 EXTERNAL

Normative Reference(s)

Bibliographic Reference(s)

  • Van Jacobson. Modified TCP Congestion Avoidance Algorithm. Technical Report, LBL, April 1990. EXTERNAL
  • Mark Allman, Chris Hayes, Hans Kruse, Shawn Ostermann. TCP Performance Over Satellite Links. Proceedings of the Fifth International Conference on Telecommunications Systems, Nashville, TN, March, 1997. EXTERNAL
  • Mark Allman. A Web Server's View of the Transport Layer. ACM Computer Communication Review, 30(5), October 2000. EXTERNAL
  • Kevin Fall and Sally Floyd. Simulation-based Comparisons of Tahoe, Reno and SACK TCP. Computer Communication Review, July 1996. EXTERNAL
  • Jitendra Padhye, Sally Floyd. Identifying the TCP Behavior of Web Servers, ACM SIGCOMM, August 2001. EXTERNAL
  • IETF RFC 2582 [Superseded*]
  • IETF RFC 2914 [Active*]
  • IETF RFC 2988 [Superseded*]
  • IETF RFC 3042 [Active*]
Source Data (JSON)

Full registry record with provenance metadata. Open directly: /api/doc/RFC3517.json

Reference Tree

Explore all references and references to this document, as a navigable tree.

Open Reference Tree
Reference this Doc

Plain text (ISO 690 compliant)

Preview:
IETF RFC 3517, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. Available at https://doi.org/10.17487/RFC3517
Snippet:
IETF RFC 3517, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. Available at https://doi.org/10.17487/RFC3517

HTML (ISO 690 compliant)

Preview:
IETF RFC 3517, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. Available at https://doi.org/10.17487/RFC3517
Snippet:
<span class="citation"><cite>IETF RFC 3517</cite>, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. Available at <a href="https://doi.org/10.17487/RFC3517" target="_blank" rel="noopener">https://doi.org/10.17487/RFC3517</a></span>

SMPTE Icon SMPTE's HTML Pub

Preview:
IETF RFC 3517, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
doi: 10.17487/RFC3517
url: https://doi.org/10.17487/RFC3517
Snippet:
<li>
<cite id="bib-rfc3517">IETF RFC 3517</cite>, A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
<span class="doi">10.17487/RFC3517</span>
</li>

Referenced By