Near-deterministic inference of AS relationships

Y. Shavitt, E. Shir, U. Weinsberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The discovery of Autonomous Systems (ASes) interconnections and the inference of their commercial Type of Relationships (ToR) has been motivated by the need to accurately calculate AS-level paths. An inherent problem in current algorithms is their extensive use of heuristics, causing unbounded errors that are spread over all inferred relationships. We propose a near-deterministic algorithm for solving the ToR inference problem that uses the Internet's core, a dense sub-graph of top-level ASes. We test several methods for creating such a core and demonstrate the robustness of the algorithm to the core's size and density, the inference period, and errors in the core. We evaluate the algorithm using AS-level paths collected from RouteViews BGP paths and DIMES traceroute measurements. Our proposed algorithm deterministically infers over 95% of the approximately 58,000 AS topology links using a week worth of data and as little as 20 ASes in the core. The algorithm infers 2-3 times more peer-to-peer relationships in links discovered only by DIMES than in RouteViews, validating the need for a broad and diverse Internet measurement effort.

Original languageEnglish
Title of host publication2009 10th International Conference on Telecommunications, ConTEL 2009
Pages191-198
Number of pages8
StatePublished - 2009
Event2009 10th International Conference on Telecommunications, ConTEL 2009 - Zagreb, Croatia
Duration: 8 Jun 200910 Jun 2009

Publication series

Name2009 10th International Conference on Telecommunications, ConTEL 2009

Conference

Conference2009 10th International Conference on Telecommunications, ConTEL 2009
Country/TerritoryCroatia
CityZagreb
Period8/06/0910/06/09

Fingerprint

Dive into the research topics of 'Near-deterministic inference of AS relationships'. Together they form a unique fingerprint.

Cite this