RACK: a time-based fast loss detection algorithm for TCP
draft-ietf-tcpm-rack-04
| Document | Type | Expired Internet-Draft (tcpm WG) | |
|---|---|---|---|
| Last updated | 2019-01-03 (latest revision 2018-07-02) | ||
| Replaces | draft-cheng-tcpm-rack | ||
| Stream | IETF | ||
| Intended RFC status | Experimental | ||
| Formats |
Expired & archived
plain text
pdf
html
bibtex
|
||
| Stream | WG state | WG Document (wg milestone: Sep 2017 - Submit document on a... ) | |
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Expired | |
| Consensus Boilerplate | Unknown | ||
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-ietf-tcpm-rack-04.txt
Abstract
This document presents a new TCP loss detection algorithm called RACK ("Recent ACKnowledgment"). RACK uses the notion of time, instead of packet or sequence counts, to detect losses, for modern TCP implementations that can support per-packet timestamps and the selective acknowledgment (SACK) option. It is intended to replace the conventional DUPACK threshold approach and its variants, as well as other nonstandard approaches.
Authors
Yuchung Cheng
(ycheng@google.com)
Neal Cardwell
(ncardwell@google.com)
Nandita Dukkipati
(nanditad@google.com)
Priyaranjan Jha
(priyarjha@google.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)