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.
Type de document :
Communication dans un congrès
Robert Bestak; Lukas Kencl; Li Erran Li; Joerg Widmer; Hao Yin. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. Springer, Lecture Notes in Computer Science, LNCS-7290 (Part II), pp.149-160, 2012, NETWORKING 2012. 〈10.1007/978-3-642-30054-7_12〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01531969
Contributeur : Hal Ifip <>
Soumis le : vendredi 2 juin 2017 - 11:23:27
Dernière modification le : vendredi 2 juin 2017 - 11:25:01
Document(s) archivé(s) le : mercredi 13 décembre 2017 - 08:35:23

Fichier

978-3-642-30054-7_12_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Syed Hasan, Sergey Gorinsky. Obscure Giants: Detecting the Provider-Free ASes. Robert Bestak; Lukas Kencl; Li Erran Li; Joerg Widmer; Hao Yin. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. Springer, Lecture Notes in Computer Science, LNCS-7290 (Part II), pp.149-160, 2012, NETWORKING 2012. 〈10.1007/978-3-642-30054-7_12〉. 〈hal-01531969〉

Partager

Métriques

Consultations de la notice

14

Téléchargements de fichiers

18