Measuring Partial Reachability in the Public Internet

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 validate adding a third: CAIDA Ark, where 171 locations traceroute to millions of networks daily. Root causes suggest that most peninsula events (45%) are routing transients, but most peninsula-time (90%) is due to long-lived events (7%). We show that the concept of peninsulas and islands can improve existing measurement systems. They identify measurement error and persistent problems in RIPE's DNSmon that are $5\times$ to $9.7\times$ larger than the operationally important changes of interest. They explain previously contradictory results in several outage detection systems. Peninsulas are at least as common as Internet outages, posing new research direction.