Skip to Main content Skip to Navigation
Conference papers

Obscure Giants: Detecting the Provider-Free ASes

Abstract : 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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531969
Contributor : Hal Ifip <>
Submitted on : Friday, June 2, 2017 - 11:23:27 AM
Last modification on : Sunday, May 31, 2020 - 6:50:03 PM
Long-term archiving on: : Wednesday, December 13, 2017 - 8:35:23 AM

File

978-3-642-30054-7_12_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

133

Files downloads

229