TY  - CHAP
A1  - Völker, Timo
A1  - Tüxen, Michael
T1  - Packet Too Big Detection and its Integration into QUIC
T2  - 2023 16th International Conference on Signal Processing and Communication System (ICSPCS)
N2  - A communication over an Internet Protocol (IP) based network fails if an endpoint sends packets that are too big to reach their destination and if the sender is unable to detect that. The node on the path that drops these packets should respond with a Packet Too Big (PTB) message. However, multiple scenarios exist in which the sender will not receive a PTB message. Even if it does, it refrains from using the information in case it suspects that a potential attacker forged the message. In particular, we are not aware of any implementation of the secure transport protocol QUIC (e.g., used by HTTP/3) that processes PTB messages. In this paper, we present a novel parameterizable PTB detection algorithm for reliable transport protocols that does not depend on PTB messages. We further describe how to integrate our algorithm into QUIC, present results from an evaluation using the algorithm within a QUIC simulation model and, based on these results, suggest concrete parameter values.
KW  - PMTUD
KW  - PTB
KW  - black hole
KW  - transport protocol
KW  - QUIC
Y1  - 2023
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:836-opus-174119
SN  - 979-8-3503-3351-0
PB  - IEEE
CY  - New York, NY, USA
ER  - 
TY  - CHAP
A1  - Völker, Timo
A1  - Volodina, Ekaterina
A1  - Tüxen, Michael
A1  - Rathgeb, Erwin Paul
T1  - A QUIC Simulation Model for INET and its Application to the Acknowledgment Ratio Issue
T2  - 2020 IFIP Networking Conference
N2  - Quick UDP Internet Connections (QUIC) is a novel transport protocol introducing known features in a new protocol design. To investigate these features and the design, we developed a QUIC implementation in the INET simulation model suite.
In this paper, we describe that implementation, its validation and a result achieved using the simulation model. The result shows the negative impact on throughput, when raising the acknowledgment ratio. We propose a solution and describe how it solves the issue.
KW  - QUIC
KW  - INET OMNeT++
KW  - Protocol Simulation
KW  - Transport Protocol
KW  - Ack Ratio
Y1  - 2020
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:836-opus-149662
UR  - https://ieeexplore.ieee.org/document/9142723
SN  - 978-3-903176-28-7
SP  - 737
EP  - 742
PB  - IEEE
CY  - New York, NY, USA
ER  - 
TY  - CHAP
A1  - Völker, Timo
A1  - Tüxen, Michael
A1  - Rathgeb, Erwin Paul
T1  - The Search of the Path MTU with QUIC
T2  - Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC
N2  - 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.
KW  - Path MTU Discovery
KW  - Search Algorithm
KW  - Simulation
KW  - Transport Protocol
KW  - QUIC
Y1  - 2021
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:836-opus-149656
SN  - 9781450391351
SP  - 22
EP  - 28
PB  - Association for Computing Machinery
CY  - New York, NY, USA
ER  -