%0 Conference Proceedings
%T Obscure Giants: Detecting the Provider-Free ASes
%+ Institute IMDEA Networks [Madrid]
%+ Carlos III University of Madrid
%A Hasan, Syed
%A Gorinsky, Sergey
%Z Part 3: Interdomain
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7290
%N Part II
%P 149-160
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30054-7_12
%K Internet economics
%K transit
%K provider-free ASes
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531969/document
%2 https://inria.hal.science/hal-01531969/file/978-3-642-30054-7_12_Chapter.pdf
%L hal-01531969
%U https://inria.hal.science/hal-01531969
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7290
%~ IFIP-NETWORKING