Skip to content
Book Open access

The Internet’s Path MTUs: How Big Can You Go?

Oct 2026 · Proceedings of the 2026 ACM Internet Measurement Conference · 0 citations · 77 references

TL;DR

A measurement study of PMTUs using RIPE Atlas to characterize their behavior in general, across protocol layers (IPv4/IPv6 and network locations thus covering 76,700 paths across access networks, the Internet core, and web-serving infrastructure, and shows that sub-1500 B PMTUs are primarily located near network edges, while core paths rarely exhibit such constraints.

Abstract

Efficient network transmission, especially in IPv6 since on-path fragmentation is not possible, depends on selecting the right packet size. The Maximum Transmission Unit (MTU) determines the largest packet size that can traverse a link and the Path MTU (PMTU) determines the size for an end-to-end path without fragmentation. Due to frequent failures in Path MTU Discovery (PMTUD), protocols must fall back to conservative packet sizes to ensure reachability, sacrificing potential throughput. This creates a need for inference-based approaches that estimate a suitable path size. Existing PMTU studies are outdated, limited in scope, and rely on indirect MSS inference or PMTUD-dependent signals, offering little insight into where MTU bottlenecks occur along the path. This paper presents a measurement study of PMTUs using RIPE Atlas to characterize their behavior in general, across protocol layers (IPv4/IPv6) and network locations thus covering 76,700 paths across access networks, the Internet core, and web-serving infrastructure. We observe 97 distinct PMTUs, though a small set:[1500 B (80.5%), 1492 B (11.7%), and 1480 B (1.5%)], dominates. PMTU distributions differ across IP versions: while 99% of IPv4 paths support at least 1420 B, IPv6 paths commonly operate at 1280 B. We further show that sub-1500 B PMTUs are primarily located near network edges, while core paths rarely exhibit such constraints. Finally, we measure PMTU vs. Maximum Segment Size (MSS)-inferred PMTU mismatches in 18.5% of paths.

Read PDF

Similar papers

Reducing the Overhead of SRv6

Benjamin Arn, Jean Mégret, Ricardo Santos et al. · 0 citations
Preprint Oct 2026

Bounding Mobile Latency from Network Interconnections

Mobile latency is determined by how Mobile Network Operators (MNOs) route traffic: from phones, across the MNO's network to exit points where it enters the public Internet. Exit points are few, and MNOs are quiet about details, but their role prompts us to ask: What is the latency cost of sending traffic through an exi...

Shefali Tushar Kulkarni, John Heidemann · 0 citations
Review Open access Sep 2026

IPv6 Hitlist Service: Lessons Learned From 10 Years of Operation

After becoming an Internet Draft more than 30 years ago, IPv6 has seen an increase in deployment and use in the past years. As measurements in the IPv6 Internet require new approaches due to the vastly larger address space, hitlists have come along as one possible source for finding IPv6 targets. One of the most promin...

Oliver Gasser, Lion Steger, Patrick Sattler et al. · 0 citations
Conference Open access Oct 2026

IPv6: A Paradigm Shift

The rapid growth of the Internet has exhausted the address space of Internet Protocol version 4 (IPv4), whose 32-bit scheme supports only about 4.3 billion unique addresses. Techniques such as Network Address Translation (NAT) and Classless Inter-Domain Routing (CIDR) have extended its life, but they add complexity, br...

Ajay Kumar · 0 citations
Book Open access Oct 2026

Endless Cookies: Exploring TCP Fast Open on the Internet

TCP Fast Open (TFO) is a TCP option designed to reduce connection establishment overhead. In this paper, we conduct the first large-scale investigation of TFO adoption on the Internet across both IPv4 and IPv6. Contrary to prior belief, we find a non-negligible rate of server-side adoption, particularly among large con...

Zahra Yazdani, Fahad Hilal, Kevin Vermeulen et al. · 0 citations
Preprint Aug 2026

Extending Low Latency Service Across the Internet

This work proposes a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps, and demonstrates the feasibility of this approach through large scale experiments on the FABRIC testbed.

Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.