@inproceedings{VoelkerTuexenRathgeb2021,
  author    = {V{\"o}lker, Timo and T{\"u}xen, Michael and Rathgeb, Erwin Paul},
  title     = {The Search of the Path MTU with QUIC},
  series = {Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC},
  booktitle = {Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  isbn      = {9781450391351},
  doi       = {10.1145/3488660.3493805},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:836-opus-149656},
  pages     = {22 -- 28},
  year      = {2021},
  abstract  = {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.},
  language  = {en}
}