[Tsvwg] Protocol Action: A Conservative SACK-based Loss Recovery Algorithm for TCP to Proposed Standard

The IESG has approved the Internet-Draft 'A Conservative SACK-based 
Loss Recovery Algorithm for TCP' <draft-allman-tcp-sack-13.txt> as a 
Proposed Standard. This document is the product of the Transport Area 
Working Group. The IESG contact persons are Scott Bradner and Allison 
Mankin.

Technical Summary

This document presents a conservative loss recovery algorithm for TCP
that is based on the use of the selective acknowledgment TCP option. 
The algorithm presented in this document conforms to the spirit of the 
current congestion control specification RFC2581, but allows TCP 
senders to recover more effectively when multiple segments are lost 
from a single flight of data.

Working Group Summary

The working group supported publishing of this document.

Protocol Quality

This document was reviewed for the IESG by Allison Mankin and Scott
Bradner.

RFC Editor Note:

 Please replace the following paragraph in section 2:
 For the purposes of this specification we define a ``duplicate
 acknowledgment'' as an acknowledgment (ACK) whose cumulative ACK
 number is equal to the current value of HighACK, as described in
 [RFC2581].

 with

 For the purposes of this specification we define a ``duplicate
 acknowledgment'' as a segment that arrives with no data and an
 acknowledgment (ACK) number that is equal to the current value
 of HighACK, as described in [RFC2581].

 also - please add the IPR notices from Sec 10.4(A) and 10.4(B)
 before the author's addresses
_______________________________________________
tsvwg mailing list
tsvwg@ietf.org
https://www1.ietf.org/mailman/listinfo/tsvwg