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

Time based reordering threshold and low RTT #586

Closed
gloinul opened this issue Jun 6, 2017 · 3 comments
Closed

Time based reordering threshold and low RTT #586

gloinul opened this issue Jun 6, 2017 · 3 comments
Labels
-recovery design An issue that affects the design of the protocol; resolution requires consensus. has-consensus An issue that the Chairs have determined has consensus, by canvassing the mailing list.

Comments

@gloinul
Copy link
Contributor

gloinul commented Jun 6, 2017

If one uses timer based reordering threshold, then it appears that there exist corner cases where it will not have good reordering suppression. As it is defined as fraction of an RTT. If the RTT sample is very short, like a local LAN delays on the order of 1-2 ms then, the reordering events may actually be longer than the regular fraction of the RTT.

Thus my question on the design is if it needs any consideration for this case.

I also asking if anyone has any measurement data that provides information on how big reordering in time that occurs in these environments. Or is this just a red herring?

@martinthomson martinthomson added design An issue that affects the design of the protocol; resolution requires consensus. -recovery labels Jun 6, 2017
@martinthomson martinthomson changed the title Recovery: Time based reordering threshold in low RTT environments Time based reordering threshold in low RTT environments Jun 20, 2017
@mnot mnot changed the title Time based reordering threshold in low RTT environments Time based reordering threshold and low RTT Jun 21, 2017
@martinthomson
Copy link
Member

The current draft makes the choice between time-based and packet-based reordering exclusive. It doesn't current offer any guidance about how to choose between the two. One criterion could be RTT: it could recommend switching to packet-based reordering detection below a certain RTT.

@ianswett
Copy link
Contributor

I'd like to provide some guidance here, but I don't have conclusive enough data to offer up guidance I can substantiate at the moment. There are certainly cases when both may make sense. I can add some considerations about when to choose which if that would be helpful. For both TCP and QUIC, this is still an evolving area of research.

@gloinul
Copy link
Contributor Author

gloinul commented Mar 9, 2018

Reviewing this issue in the context of -10 version. It appears there is now discussion on this issue in the last paragraph of Section 3.2.1. (Fast Retransmit). Thus, I think this issue is addressed and will close the issue. Yell if you want it reopened.

@gloinul gloinul closed this as completed Mar 9, 2018
@mnot mnot added the has-consensus An issue that the Chairs have determined has consensus, by canvassing the mailing list. label Mar 5, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
-recovery design An issue that affects the design of the protocol; resolution requires consensus. has-consensus An issue that the Chairs have determined has consensus, by canvassing the mailing list.
Projects
None yet
Development

No branches or pull requests

4 participants