Measuring Partial Reachability in the Public Internet
Guillermo Baltra, Tarang Saluja, Yuri Pradkin, John Heidemann

TL;DR
This paper introduces algorithms to detect partial connectivity issues in the public Internet, revealing persistent routing problems and measurement errors that impact global reachability assessments.
Contribution
The paper presents two novel algorithms, Taitao and Chiloe, for identifying peninsulas and islands of partial Internet connectivity using existing measurement data.
Findings
Most peninsula events are routing transients.
90% of peninsula-time is due to long-lived events.
Measurement errors can be 5 to 9.7 times larger than operational changes.
Abstract
The Internet provides global connectivity by virtue of a public core -- the routable public IP addresses that host services and to which cloud, enterprise, and home networks connect. Today the public core faces many challenges to uniform, global reachability: firewalls and access control lists, commercial disputes that stretch for days or years, and government-mandated sanctions. We define two algorithms to detect partial connectivity: Taitao detects peninsulas of persistent, partial connectivity, and Chiloe detects islands, when one or more computers are partitioned from the public core. These new algorithms apply to existing data collected by multiple long-lived measurement studies. We evaluate these algorithms with rigorous measurements from two platforms: Trinocular, where 6 locations observe 5M networks frequently, RIPE Atlas, where 10k locations scan the DNS root frequently, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
