The Search of the Path MTU with QUIC
- A data sender in an IP based network is only capable to efficiently use a network path if it knows the packet size limit of the path, i.e., the Path Maximum Transmission Unit (PMTU). The IETF recently specified a PMTU discovery framework for transport protocols like QUIC. This paper complements this specification by presenting a search algorithm. In addition, it defines several metrics and shows results of analyses for the algorithm with various PMTU candidate sequences using these metrics. We integrated the PMTU discovery with our algorithm into a QUIC simulation model. This paper describes the integration and presents measurements obtained by simulations.
| Author: | Timo VölkerORCiD, Michael TüxenORCiD, Erwin Paul RathgebORCiD |
|---|---|
| URN: | urn:nbn:de:hbz:836-opus-149656 |
| DOI: | https://doi.org/10.1145/3488660.3493805 |
| ISBN: | 9781450391351 |
| Parent Title (English): | Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC |
| Publisher: | Association for Computing Machinery |
| Place of publication: | New York, NY, USA |
| Document Type: | Conference Proceeding |
| Language: | English |
| Date of Publication (online): | 2022/04/13 |
| Date of first Publication: | 2021/12/07 |
| Provider of the Publication Server: | FH Münster - University of Applied Sciences |
| Release Date: | 2022/04/19 |
| Tag: | Path MTU Discovery; QUIC; Search Algorithm; Simulation; Transport Protocol |
| First Page: | 22 |
| Last Page: | 28 |
| Faculties: | Elektrotechnik und Informatik (ETI) |
| Publication list: | Tüxen, Michael |
| Völker, Timo | |
| Licence (German): |  Zweitveroeffentlichung |