Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Editorial cleanup of Recovery #1957

Merged
merged 17 commits into from Nov 4, 2018
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
15 changes: 7 additions & 8 deletions draft-ietf-quic-recovery.md
Expand Up @@ -273,14 +273,13 @@ fraction of an RTT, but implemenantations MAY experiment with absolute
thresholds. This may be used either as a replacement for a packet reordering
threshold or in addition to it.

When a larger packet is acknowledged, if it was sent more than the
threshold after any in flight packets, those packets are immediately declared
lost. Otherwise, a timer is set for the the reordering threshold minus the
time difference between the earliest in flight packet and the largest newly
acknowledged packet. Note that in some cases the timer could become longer
when packets are acknowleged out of order. The RECOMMENDED time threshold,
expressed as a fraction of the round-trip time (kTimeReorderingFraction),
is 1/8.
When a larger packet is acknowledged, if it was sent more than the threshold
after any in flight packets, those packets are immediately declared lost.
Otherwise, a timer is set for the the reordering threshold minus the time
difference between the earliest in flight packet and the largest newly
acknowledged packet. Note that in some cases the timer could become longer when
packets are acknowleged out of order. The RECOMMENDED time threshold, expressed
as a fraction of the round-trip time (kTimeReorderingFraction), is 1/8.

### Early Retransmit

Expand Down