RACK: a time-based fast loss detection algorithm for TCP
draft-cheng-tcpm-rack-01

Document Type Replaced Internet-Draft (individual)
Last updated 2016-07-06
Replaced by draft-ietf-tcpm-rack
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-tcpm-rack
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-cheng-tcpm-rack-01.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)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)