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

Ethan Blanton; Mark Allman; Lili Wang; Ilpo Järvinen; Markku P I Kojo; Yoshifumi Nishida

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

Ethan Blanton, Mark Allman, Lili Wang, Ilpo Järvinen, Markku P I Kojo, Yoshifumi Nishida

Avdelningen för datavetenskap

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Kapitel › Vetenskaplig › Peer review

Sammanfattning

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 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it.

Originalspråk	engelska
Titel på värdpublikation	Request for comments
Antal sidor	15
Förlag	Internet Engineering Task Force
Utgivningsdatum	2012
Status	Publicerad - 2012
MoE-publikationstyp	A3 Del av bok eller annan forskningsbok

Publikationsserier

Namn	Internet RFCs
Nummer	RFC 6675
ISSN (elektroniskt)	2070-1721

Vetenskapsgrenar

113 Data- och informationsvetenskap

Åtkomst av dokument

http://www.rfc-editor.org/rfc/rfc6675.txt

Citera det här

@inbook{d832cfe77af54439ad2a75af70e7aecc,

title = "A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP",

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 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it.",

keywords = "113 Computer and information sciences",

author = "Ethan Blanton and Mark Allman and Lili Wang and Ilpo J{\"a}rvinen and Kojo, {Markku P I} and Yoshifumi Nishida",

year = "2012",

language = "English",

series = "Internet RFCs",

publisher = "Internet Engineering Task Force",

number = "RFC 6675",

booktitle = "Request for comments",

address = "International",

}

TY - CHAP

T1 - A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP

AU - Blanton, Ethan

AU - Allman, Mark

AU - Wang, Lili

AU - Järvinen, Ilpo

AU - Kojo, Markku P I

AU - Nishida, Yoshifumi

PY - 2012

Y1 - 2012

N2 - 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 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it.

AB - 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 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it.

KW - 113 Computer and information sciences

M3 - Chapter

T3 - Internet RFCs

BT - Request for comments

PB - Internet Engineering Task Force

ER -