@@ -1468,22 +1468,21 @@
QUIC uses a probe timeout (PTO; see Section 6.2), with a timer based on TCP's RTO
computation; see [RFC6297]. QUIC's PTO includes the peer's maximum expected
acknowledgment delay instead of using a fixed minimum timeout.¶
-
As reflected by TLP defined in RACK ([RACK]), a single
-packet loss at the tail does not indicate persistent congestion, so QUIC does
-not collapse the congestion window when the PTO expires. Instead of
-collapsing the congestion window and declaring everything in-flight lost, QUIC
-specifies a time-based definition to ensure one or more packets are sent prior
-to a dramatic decrease in congestion window; see Section 7.6.
-QUIC allows probe packets to temporarily exceed the congestion window
-whenever the timer expires.¶
-
In doing this, QUIC avoids unnecessary congestion window reductions, obviating
+
Similar to the RACK-TLP loss detection algorithm for TCP
+([RACK]), QUIC does not collapse the congestion window
+when the PTO expires, since a single packet loss at the tail does not indicate
+persistent congestion. Instead, QUIC collapses the congestion window when
+persistent congestion is declared; see Section 7.6.¶
+
QUIC allows probe packets to temporarily exceed the congestion window whenever
+the timer expires.¶
+
In doing this, QUIC avoids unnecessary congestion window reductions, obviating
the need for correcting mechanisms such as F-RTO ([RFC5682]). Since QUIC does
not collapse the congestion window on a PTO expiration, a QUIC sender is not
limited from sending more in-flight packets after a PTO expiration if it still
has available congestion window. This occurs when a sender is
application-limited and the PTO timer expires. This is more aggressive than
TCP's RTO mechanism when application-limited, but identical when not
-application-limited.¶
+application-limited.
¶
@@ -1711,7 +1710,7 @@
Acknowledgment-based loss detection implements the spirit of TCP's Fast
Retransmit ([RFC5681]), Early Retransmit ([RFC5827]), FACK ([FACK]),
-SACK loss recovery ([RFC6675]), and RACK ([RACK]). This
+SACK loss recovery ([RFC6675]), and RACK-TLP ([RACK]). This
section provides an overview of how these algorithms are implemented in QUIC.¶
A packet is declared lost if it meets all the following conditions:¶
@@ -2527,11 +2526,11 @@
- [QUIC-TLS]
-
-Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure QUIC", Work in Progress, Internet-Draft, draft-ietf-quic-tls, , <https://tools.ietf.org/html/draft-ietf-quic-tls>.
+Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure QUIC", Work in Progress, Internet-Draft, draft-ietf-quic-tls, , <https://tools.ietf.org/html/draft-ietf-quic-tls>.
- [QUIC-TRANSPORT]
-
-Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based Multiplexed and Secure Transport", Work in Progress, Internet-Draft, draft-ietf-quic-transport, , <https://tools.ietf.org/html/draft-ietf-quic-transport>.
+Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based Multiplexed and Secure Transport", Work in Progress, Internet-Draft, draft-ietf-quic-transport, , <https://tools.ietf.org/html/draft-ietf-quic-transport>.
- [RFC2119]
-
diff --git a/ianswett-rack-tlp/draft-ietf-quic-recovery.txt b/ianswett-rack-tlp/draft-ietf-quic-recovery.txt
index b6ae279a39..e80d355a07 100644
--- a/ianswett-rack-tlp/draft-ietf-quic-recovery.txt
+++ b/ianswett-rack-tlp/draft-ietf-quic-recovery.txt
@@ -5,8 +5,8 @@
QUIC J. Iyengar, Ed.
Internet-Draft Fastly
Intended status: Standards Track I. Swett, Ed.
-Expires: 10 July 2021 Google
- 6 January 2021
+Expires: 11 July 2021 Google
+ 7 January 2021
QUIC Loss Detection and Congestion Control
@@ -43,7 +43,7 @@ Status of This Memo
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
- This Internet-Draft will expire on 10 July 2021.
+ This Internet-Draft will expire on 11 July 2021.
Copyright Notice
@@ -317,14 +317,14 @@ Table of Contents
peer's maximum expected acknowledgment delay instead of using a fixed
minimum timeout.
- As reflected by TLP defined in RACK ([RACK]), a single packet loss at
- the tail does not indicate persistent congestion, so QUIC does not
- collapse the congestion window when the PTO expires. Instead of
- collapsing the congestion window and declaring everything in-flight
- lost, QUIC specifies a time-based definition to ensure one or more
- packets are sent prior to a dramatic decrease in congestion window;
- see Section 7.6. QUIC allows probe packets to temporarily exceed the
- congestion window whenever the timer expires.
+ Similar to the RACK-TLP loss detection algorithm for TCP ([RACK]),
+ QUIC does not collapse the congestion window when the PTO expires,
+ since a single packet loss at the tail does not indicate persistent
+ congestion. Instead, QUIC collapses the congestion window when
+ persistent congestion is declared; see Section 7.6.
+
+ QUIC allows probe packets to temporarily exceed the congestion window
+ whenever the timer expires.
In doing this, QUIC avoids unnecessary congestion window reductions,
obviating the need for correcting mechanisms such as F-RTO
@@ -557,9 +557,9 @@ Table of Contents
Acknowledgment-based loss detection implements the spirit of TCP's
Fast Retransmit ([RFC5681]), Early Retransmit ([RFC5827]), FACK
- ([FACK]), SACK loss recovery ([RFC6675]), and RACK ([RACK]). This
- section provides an overview of how these algorithms are implemented
- in QUIC.
+ ([FACK]), SACK loss recovery ([RFC6675]), and RACK-TLP ([RACK]).
+ This section provides an overview of how these algorithms are
+ implemented in QUIC.
A packet is declared lost if it meets all the following conditions:
@@ -1325,13 +1325,13 @@ Table of Contents
[QUIC-TLS] Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure
QUIC", Work in Progress, Internet-Draft, draft-ietf-quic-
- tls, 6 January 2021,
+ tls, 7 January 2021,
.
[QUIC-TRANSPORT]
Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based
Multiplexed and Secure Transport", Work in Progress,
- Internet-Draft, draft-ietf-quic-transport, 6 January 2021,
+ Internet-Draft, draft-ietf-quic-transport, 7 January 2021,
.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
diff --git a/ianswett-rack-tlp/draft-ietf-quic-tls.html b/ianswett-rack-tlp/draft-ietf-quic-tls.html
index 5d71066f05..7fbf2a8445 100644
--- a/ianswett-rack-tlp/draft-ietf-quic-tls.html
+++ b/ianswett-rack-tlp/draft-ietf-quic-tls.html
@@ -824,7 +824,7 @@
| Thomson & Turner |
-Expires 10 July 2021 |
+Expires 11 July 2021 |
[Page] |
@@ -837,12 +837,12 @@
- draft-ietf-quic-tls
- Published:
-
-
+
- Intended Status:
- Standards Track
- Expires:
-
+
- Authors:
-
@@ -894,7 +894,7 @@
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."¶
- This Internet-Draft will expire on 10 July 2021.¶
+ This Internet-Draft will expire on 11 July 2021.
¶