<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.allman-tcp-sack" target="https://datatracker.ietf.org/doc/html/draft-allman-tcp-sack-13">
   <front>
      <title>A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP</title>
      <author initials="L." surname="Wang" fullname="Lili Wang">
         <organization>University of Kentucky</organization>
      </author>
      <author initials="M." surname="Allman" fullname="Mark Allman">
         <organization>BBN/NASA GRC</organization>
      </author>
      <author initials="E." surname="Blanton" fullname="Ethan Blanton">
         <organization>Purdue University</organization>
      </author>
      <author initials="K." surname="Fall" fullname="Kevin Fall">
         <organization>Intel Research</organization>
      </author>
      <date month="October" day="9" year="2002" />
      <abstract>
	 <t>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 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. [STANDARDS-TRACK]
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-allman-tcp-sack-13" />
   
</reference>
