Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis > publications : papers : 2019 : stable_practical_as_relationship
Stable and Practical AS Relationship Inference with ProbLink
Y. Jin, C. Scott, A. Dhamdhere, V. Giotsas, A. Krishnamurthy, and S. Shenker, "Stable and Practical AS Relationship Inference with ProbLink", in USENIX Symposium on Networked Systems Design and Implementation (NSDI), Feb 2019, pp. 581--597.

The ProbLink code is available in the ProbLink Github repo.

|   View full paper:    PDF    Data Supplement    Related Presentation    |  Citation:    BibTeX    Resource Catalog   |

Stable and Practical AS Relationship Inference with ProbLink

Yuchen Jin5
Colin Scott2, 3
Amogh Dhamdhere1
Vasileios Giotsas4
Arvind Krishnamurthy5
Scott Shenker2, 3

CAIDA, San Diego Supercomputer Center, University of California San Diego


International Computer Science Institute (ICSI)


University of California, Berkeley


University of Lancaster


University of Washington

Knowledge of the business relationships between Autonomous Systems (ASes) is essential to understanding the behavior of the Internet routing system. Despite significant progress in the development of relationship inference algorithms, the resulting inferences are impractical for many critical real-world applications, cannot offer adequate predictability in the configuration of routing policies, and suffer from inference oscillations. To achieve more practical and stable relationship inference, we first illuminate the root causes of the contradiction between these shortcomings and the near-perfect validation results for AS-Rank, the state-of-the-art relationship inference algorithm. Using a "naive" inference approach as a benchmark, we find that available validation datasets over-represent AS links with easier inference requirements. We identify which types of links are harder to infer and develop appropriate validation subsets to enable more representative evaluation.

We then develop a probabilistic algorithm, ProbLink, to overcome the challenges in inferring hard links, such as nonvalley-free routing, limited visibility, and non-conventional peering practices. ProbLink reveals key AS-interconnection features derived from stochastically informative signals. Compared to AS-Rank, our approach reduces the error rate for all links by 1.6x and, importantly, by up to 6.1x for various types of hard links. We demonstrate the practical significance of our improvements by evaluating their impact on three applications. Compared to the current state-of-theart, ProbLink increases the precision and recall of route leak detection by 4.1x and 3.4x respectively, reveals 27% more complex relationships, and increases the precision of predicting the impact of selective advertisements by 34%.

Keywords: economics, measurement methodology, routing, topology
  Last Modified: Tue Nov-17-2020 04:47:37 UTC
  Page URL: