Movatterモバイル変換


[0]ホーム

URL:


Search RFCs

Advanced Search

RFC Editor

RFC 6675

A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP,August 2012

File formats:
icon for text fileicon for PDFicon for HTML
Status:
PROPOSED STANDARD
Obsoletes:
RFC 3517
Authors:
E. Blanton
M. Allman
L. Wang
I. Jarvinen
M. Kojo
Y. Nishida
Stream:
IETF
Source:
tcpm (wit)

Cite this RFC:TXT  | XML  |  BibTeX

DOI:  https://doi.org/10.17487/RFC6675

Discuss this RFC: Send questions or comments to the mailing listtcpm@ietf.org

Other actions:Submit Errata  | Find IPR Disclosures from the IETF  | View History of RFC 6675


Abstract

This document presents a conservative loss recovery algorithm for TCPthat is based on the use of the selective acknowledgment (SACK) TCP option. Thealgorithm presented in this document conforms to the spirit of the currentcongestion control specification (RFC 5681), but allows TCP senders to recovermore effectively when multiple segments are lost from a single flight of data.This document obsoletes RFC 3517 and describes changes from it. [STANDARDS-TRACK]


For the definition ofStatus,seeRFC 2026.

For the definition ofStream, seeRFC 8729.




IABIANAIETFIRTFISEISOCIETF Trust
ReportsPrivacy StatementSite MapContact Us

Advanced Search

[8]ページ先頭

©2009-2026 Movatter.jp