Packetization Layer Path MTU Discovery for Datagram Transports
draft-fairhurst-tsvwg-datagram-plpmtud-02

Document Type Replaced Internet-Draft (tsvwg WG)
Last updated 2018-01-17 (latest revision 2017-12-06)
Replaced by draft-ietf-tsvwg-datagram-plpmtud
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state Adopted by a WG
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-tsvwg-datagram-plpmtud
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-fairhurst-tsvwg-datagram-plpmtud-02.txt

Abstract

This document describes a robust method for Path MTU Discovery (PMTUD) for datagram Packetization layers. The method allows a Packetization layer (or a datagram application that uses it) to probe an network path with progressively larger packets to determine a maximum packet size. The document describes as an extension to RFC 1191 and RFC 8201, which specify ICMP-based Path MTU Discovery for IPv4 and IPv6. This provides functionally for datagram transports that is equivalent to the Packetization layer PMTUD specification for TCP, specified in RFC4821. When published, this specification updates RFC4821.

Authors

Gorry Fairhurst (gorry@erg.abdn.ac.uk)
Tom Jones (tom@erg.abdn.ac.uk)
Michael Tüxen (tuexen@fh-muenster.de)
Irene Ruengeler (i.ruengeler@fh-muenster.de)

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