A new method is developed to evaluate the latency cost of sending traffic through an exit point on the three largest U.S. MNOs, and shows that geographic optimization saves little latency: the inflation users experience comes from routing and other overhead.
Abstract
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 exit point? We develop a new method to evaluate this question, and demonstrate it on the three largest U.S. MNOs, although in principle it can apply globally. Using new analysis of existing traceroutes, we find that AT&T, T-Mobile, and Verizon funnel nationwide traffic through only 9, 5, and 9 exits, and the geographic detour they incur adds up to 62.1 ms compared to an ideal, direct-path latency. Routing delays also add latency. We show that even assuming speed-of-light paths through the exit points, latency is still up to 46.9 ms more than optimal. To understand if these costs can be overcome, we compare actual to theoretically optimal placements, finding that the latencies of current placements are 18-66% above the population-weighted optimum and 32-72% above the market-share-weighted optimum with the same number of exits. However, we show this gap is small in absolute terms: perfect placement would recover only a few milliseconds of the tens that remain. We show that geographic optimization saves little latency: the inflation users experience comes from routing and other overhead.
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,...
Jonathan Binkle, Vaishnavi Raghavajosyula, Tiago Heinrich et al.· Proceedings of the 2026 ACM...· 0 citations
It is shown with a sampling based experiment that the solution with the best MLU fares the worst under strong traffic variations, and that it is worth to minimize not only the MLU but also the number of rerouted paths.
Benjamin Arn, Jean Mégret, Ricardo Santos et al.· 0 citations
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
This paper presents our experiences in deploying YU, Alibaba’s in-house traffic load verification system for wide area networks (WAN), in data center networks (DCN). We encounter two key challenges: the opaque ISP challenge, where the opaque nature of the configurations of peering ISPs results in low accuracy of inter-...
Zijian Zhang, Yi-Fan Li, Xing Fang et al.· IEEE Transactions on Network...· 0 citations
How far an objective function can go with the radio alone is asked, as two mechanisms read the same signal level, trend and staleness are read by two mechanisms, which share a parent-selection policy.
J. G. P. De Bittencourt, F. G. De Oliveira, E. Pacheco et al.· IEEE Open Journal of the Com...· 0 citations
Recent advancements in the fields of industrial automation and in-vehicle communication have also increased the requirements on their underlying networks. Traditional field bus technologies are being replaced by regular Ethernet devices with features from the IEEE Time-Sensitive Networking working group. Their standard...
Alexej Grigorjew, Stefan Geissler, Jürgen Schmitt 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.