RACK: a time-based fast loss detection algorithm for TCP
draft-cheng-tcpm-rack-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Yuchung Cheng , Neal Cardwell | ||
| Last updated | 2016-04-21 (Latest revision 2015-10-19) | ||
| Replaced by | draft-ietf-tcpm-rack, draft-ietf-tcpm-rack, draft-ietf-tcpm-rack, RFC 8985 | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)