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...

ver descrição completa

Detalhes bibliográficos
Autores: Hasan, Syed, Gorinsky, Sergey|||0000-0001-9612-8081
Formato: informe técnico
Fecha de publicación:2011
País:España
Recursos:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/1057
Acesso em linha:http://hdl.handle.net/20.500.12761/1057
https://dx.doi.org/TR-IMDEA Networks-2011-3
Access Level:acceso abierto
Palavra-chave:Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
id ES_b8cd2e13db9f5e4dcfc4fcca975abe92
oai_identifier_str oai:dspace.networks.imdea.org:20.500.12761/1057
network_acronym_str ES
network_name_str España
repository_id_str
spelling Obscure Giants: Detecting the Provider-Free ASesHasan, SyedGorinsky, Sergey|||0000-0001-9612-8081Q Science::Q Science (General)Q Science::QA Mathematics::QA75 Electronic computers. Computer scienceT Technology::T Technology (General)T Technology::TA Engineering (General). Civil engineering (General)T Technology::TK Electrical engineering. Electronics Nuclear engineeringInternet 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.Institute IMDEA NetworkspubIMDEA Networks Institute20112011-12-01reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reporthttp://hdl.handle.net/20.500.12761/1057https://dx.doi.org/TR-IMDEA Networks-2011-3reponame:IMDEA Networks Institute Digital Repositoryinstname:IMDEA Networks InstituteInglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:dspace.networks.imdea.org:20.500.12761/10572026-06-06T12:35:51Z
dc.title.none.fl_str_mv Obscure Giants: Detecting the Provider-Free ASes
title Obscure Giants: Detecting the Provider-Free ASes
spellingShingle Obscure Giants: Detecting the Provider-Free ASes
Hasan, Syed
Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
title_short Obscure Giants: Detecting the Provider-Free ASes
title_full Obscure Giants: Detecting the Provider-Free ASes
title_fullStr Obscure Giants: Detecting the Provider-Free ASes
title_full_unstemmed Obscure Giants: Detecting the Provider-Free ASes
title_sort Obscure Giants: Detecting the Provider-Free ASes
dc.creator.none.fl_str_mv Hasan, Syed
Gorinsky, Sergey|||0000-0001-9612-8081
author Hasan, Syed
author_facet Hasan, Syed
Gorinsky, Sergey|||0000-0001-9612-8081
author_role author
author2 Gorinsky, Sergey|||0000-0001-9612-8081
author2_role author
dc.subject.none.fl_str_mv Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
topic Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-12-01
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12761/1057
https://dx.doi.org/TR-IMDEA Networks-2011-3
url http://hdl.handle.net/20.500.12761/1057
https://dx.doi.org/TR-IMDEA Networks-2011-3
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IMDEA Networks Institute
publisher.none.fl_str_mv IMDEA Networks Institute
dc.source.none.fl_str_mv reponame:IMDEA Networks Institute Digital Repository
instname:IMDEA Networks Institute
instname_str IMDEA Networks Institute
reponame_str IMDEA Networks Institute Digital Repository
collection IMDEA Networks Institute Digital Repository
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417680066314240
score 15,811543

Registos relacionados