<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-tcpm-rack" target="https://datatracker.ietf.org/doc/html/draft-ietf-tcpm-rack-07">
   <front>
      <title>RACK: a time-based fast loss detection algorithm for TCP</title>
      <author initials="Y." surname="Cheng" fullname="Yuchung Cheng">
         <organization>Google, Inc</organization>
      </author>
      <author initials="N." surname="Cardwell" fullname="Neal Cardwell">
         <organization>Google, Inc</organization>
      </author>
      <author initials="N." surname="Dukkipati" fullname="Nandita Dukkipati">
         <organization>Google, Inc</organization>
      </author>
      <author initials="P." surname="Jha" fullname="Priyaranjan Jha">
         <organization>Google, Inc</organization>
      </author>
      <date month="January" day="17" year="2020" />
      <abstract>
	 <t>   This document presents a new TCP loss detection algorithm called RACK
   (&quot;Recent ACKnowledgment&quot;).  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.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-tcpm-rack-07" />
   
</reference>
