-
-
Notifications
You must be signed in to change notification settings - Fork 1.3k
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
Path MTU Discovery is highly affected by packet loss #4520
Comments
We might not need #4519 (or at the very least reduce the number of flake attempts) once we have this. |
I think this even violates RFC 8899:
The RFC seems to recommend up to 3 probes before giving up: https://datatracker.ietf.org/doc/html/rfc8899#name-constants This paper by the RFC 8899 authors looks quite interesting: https://www.hb.fh-muenster.de/opus4/frontdoor/deliver/index/docId/14965/file/dplpmtudQuicPaper.pdf |
Thank you @bt90! I wasn't aware of this paper, and I'm not sure I understand how they deal with packet loss: Every time a probe packet is lost, you have the choice to either re-probe the same size, or reduce the probe size by a little and probe a slightly smaller size. I don't think it hugely matters, PMTUD is cheap, so going for something simple might be the better answer than hunting for the most optimal solution. |
That one is covered by the RFC: https://datatracker.ietf.org/doc/html/rfc8899#name-probing-for-a-larger-plpmtu tl;dr: the search only stops after multiple probes failed |
Loss of a single probe packet will make the MTU discoverer believe that it has reached the path's MTU. This is unnecessarily aggressive.
It doesn't cost a lot to send a second probe packet of the same size (in most cases just 1 extra packet, if you're careful), to confirm that the loss was actually caused by exceeding the MTU.
The concrete algorithm is still tbd.
The text was updated successfully, but these errors were encountered: