Visual RFC.
ALL RFCs / RFC 8201
Read the RFC ↗
RFC 8201 / IPv6 Path MTU

Share the right path state

04

A host caches an estimate under a local representation of a path. Multiple transports can share that path, while another interface or a different group of routes may need a different estimate.

RFC 8201 · § 5.2EXAMPLE
4 / 4
Share the right path stateA separate multicast example branches to receivers over 1400- and 1280-byte paths. Subsequent group packets must fit the minimum 1280 limit; the wider path does not erase the narrow branch.Keep the estimate with the right pathMulticast senderReceiver AReceiver Bpath limit 1400path limit 1280Copies traverse different pathsSubsequent group packet ≤ 1280Local notifications and network paths are distinct
04
Take the minimum for a group

Separate multicast example: packet copies reach receivers over 1400 and 1280 paths. Subsequent group packets use a size no larger than 1280. The wider branch does not make the narrow branch disappear.

Source for this drawing: RFC 8201 · Read RFC section 5.2 ↗

Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
New to this? Start hereA quick picture + helpful background

A message needs an address.

Think of a packet as a small addressed envelope. Devices pass it onward; transport protocols decide what delivery promises an application gets.

Helpful first, if these ideas are unfamiliar

These pictures are analogies to help you learn. The linked RFC explains the actual rules.

Related RFCs and changes

“Updates” changes part of an earlier RFC. “Obsoletes” replaces it. This list shows selected related documents.

KEY POINT

Notify all active users of a decreased path estimate, and separately identify the particular dropped packet.

  • §5.2 leaves the local path representation to the implementation. Per-destination, per-flow or even a conservative global minimum are discussed possibilities, not one mandated cache key. For multiple interfaces, PMTU information should be maintained for each IPv6 link.
  • The first two states choose a destination-plus-link cache key for illustration. PathA begins at first-hop 1500 and pathB at first-hop 9000. A correlated PTB 1400 on A changes only A; TCP and UDP users of A learn the decrease, while unrelated B stays 9000.
  • All packetization-layer instances actively using the decreased path must be notified (§5.2), even TCP when the original quoted packet used UDP. This is separate from notifying the specific originating instance that its packet was dropped. Only that connection is eligible for an immediate retransmission response described in §5.4.
  • If no estimate decrease occurs, the instance that sent the dropped packet should still receive a drop notification (§5.2). Notifications may use an asynchronous signal or suitable send-error/next-send design; no particular operating-system API is mandated.
  • For a per-destination cache covering multiple paths, store the minimum learned PMTU across those paths (§5.2). A single source/destination pair can still have multiple paths, such as equal-cost multipath routing (ECMP). Per-flow storage can distinguish some of those choices when enough information exists.
  • Multicast copies can follow different paths to several receivers. The minimum across the paths in use limits subsequent packets to the multicast destination (§3). Receiving one large-MTU report does not erase a smaller relevant path limit. A destination that appears on-link can still hide a proxy/router path and needs discovery (§3).
DETAILS

Example cache keys are teaching choices. Arrows marked notification describe local software signals; multicast branches describe separate packet copies.

Read the RFC section ↗

All chapters in RFC 8201

Drawing view

Scroll the drawing to see every part. Playback controls stay above it.

RFC 9700 / CHAPTERS

Chapters

For full details, tables, algorithms, and exceptions, read the original RFC.

RFC status and corrections ↗