Skip to main content

Path MTU Algorithms and Issues in QUIC Applications
draft-pskim-pmtu-algorithm-issue-00

Document Type Expired Internet-Draft (individual)
Expired & archived
Author Pyung Soo Kim
Last updated 2026-01-07 (Latest revision 2025-07-06)
RFC stream (None)
Intended RFC status (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

This draft consider Path MTU (PMTU) alogorithms and issues in QUIC applications. Fistly, a passive probing approach is adopted to discover the PMTU. The process of discovering the PMTU is not performed separately, but is performed simultaneously in the actual application data communication. A probe packet is defined newly using 1-RTT packet which includes actual application data as well as a short packet header and a PING_EXT frame. Until the optimal PMTU is discovered, the size of the probe packet is changed according to the size of the PMTU candidate. Secondly, a PMTU black hole problem in secure and reliable transport protocol is discussed and a possible solution can be suggested from existing researches. Thirdly, PMTU issues for media delivery over UDP, such as WebRTC and media over QUIC (MoQ) are discussed.

Authors

Pyung Soo Kim

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)