Obscure Giants: Detecting the Provider-Free ASes - NETWORKING 2012 Access content directly
Conference Papers Year : 2012

Obscure Giants: Detecting the Provider-Free ASes


Internet routing depends on economic relationships between ASes (Autonomous Systems). Despite extensive prior research of these relationships, their characterization remains imprecise. In this paper, we focus on provider-free ASes that reach the entire Internet without paying anyone for the traffic delivery. While the ground truth about PFS (set of the provider-free ASes) lies outside the public domain, we use trustworthy non-verifiable sources as a baseline for result validation. Straightforward extraction of PFS from public datasets of inter-AS economic relationships yields poor results. Then, we develop a more sophisticated Temporal Cone (TC) algorithm that relies on topological statistics (customer cones of ASes) and exploits the temporal diversity of the datasets. Our evaluation shows that the TC algorithm infers PFS from the same public datasets with a significantly higher accuracy. We also assess the sensitivity of the TC algorithm to its parameters.
Fichier principal
Vignette du fichier
978-3-642-30054-7_12_Chapter.pdf (320.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01531969 , version 1 (02-06-2017)





Syed Hasan, Sergey Gorinsky. Obscure Giants: Detecting the Provider-Free ASes. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.149-160, ⟨10.1007/978-3-642-30054-7_12⟩. ⟨hal-01531969⟩
107 View
77 Download



Gmail Facebook X LinkedIn More