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.

Sign up for GitHub

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

Jump to bottom

Better duplicate detection #3696

Merged
merged 7 commits into from May 27, 2020
Merged

Better duplicate detection #3696

Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
927fe39
Better duplicate detection
martinthomson May 26, 2020
9f8038d
Remove migration from the example
martinthomson May 26, 2020
0f6ca28
Rewording to avoid potential confusion
martinthomson May 26, 2020
d90c544
Tweaking
martinthomson May 26, 2020
081f95f
Rewrap
martinthomson May 26, 2020
cbb0b2b
remove unnecessary sentence
martinthomson May 26, 2020
4d1bee3
plurals
martinthomson May 27, 2020
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
2 changes: 1 addition & 1 deletion draft-ietf-quic-transport.md
View file
Open in desktop
Expand Up @@ -3211,7 +3211,7 @@ duplicates are at risk of accumulating excessive state. The data required for
detecting duplicates can be limited by maintaining a minimum packet number below
which all packets are immediately dropped. Any minimum needs to account for
large variations in round trip time, which includes the possibility that a peer
might probe a network path with a much longer round trip time; see
might probe network paths with a much larger round trip times; see
{{migration}}.

Packet number encoding at a sender and decoding at a receiver are described in
Expand Down