Understanding edge connectivity in the internet through core decomposition
- Autores
- Alvarez Hamelin, Jose Ignacio; Beiro, Mariano Gastón; Busch, Jorge R.
- Año de publicación
- 2011
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- The Internet is a complex network composed of several networks: the autonomous systems. Each of them is designed with the aim of transporting information efficiently. This information is carried over routes, which are discovered by routing protocols, such as the border gateway protocol (BGP). The protocols may find possible paths between nodes whenever they exist, or even find paths satisfying specific constraints, e.g., a certain quality of service (QoS). Here, we study connectivity as a network attribute related to both situations; we provide a formal lower bound to it based on core decomposition and low-complexity algorithms to find it. Then we apply these algorithms to analyze maps obtained from the prominent Internet mapping projects, and use the LaNet-vi open-source software for their visualization.
Fil: Alvarez Hamelin, Jose Ignacio. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería; Argentina; Argentina
Fil: Beiro, Mariano Gastón. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Busch, Jorge R.. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina - Materia
-
Internet Topology
Complex Systems
Graph Theory
Algorithms - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/14763
Ver los metadatos del registro completo
id |
CONICETDig_423973d5d5e3ba8f6a659b63a4b0e109 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/14763 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Understanding edge connectivity in the internet through core decompositionAlvarez Hamelin, Jose IgnacioBeiro, Mariano GastónBusch, Jorge R.Internet TopologyComplex SystemsGraph TheoryAlgorithmshttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2The Internet is a complex network composed of several networks: the autonomous systems. Each of them is designed with the aim of transporting information efficiently. This information is carried over routes, which are discovered by routing protocols, such as the border gateway protocol (BGP). The protocols may find possible paths between nodes whenever they exist, or even find paths satisfying specific constraints, e.g., a certain quality of service (QoS). Here, we study connectivity as a network attribute related to both situations; we provide a formal lower bound to it based on core decomposition and low-complexity algorithms to find it. Then we apply these algorithms to analyze maps obtained from the prominent Internet mapping projects, and use the LaNet-vi open-source software for their visualization.Fil: Alvarez Hamelin, Jose Ignacio. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería; Argentina; ArgentinaFil: Beiro, Mariano Gastón. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Busch, Jorge R.. Universidad de Buenos Aires. Facultad de Ingeniería; ArgentinaTaylor & Francis2011-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/14763Alvarez Hamelin, Jose Ignacio; Beiro, Mariano Gastón; Busch, Jorge R.; Understanding edge connectivity in the internet through core decomposition; Taylor & Francis; Internet Mathematics; 7; 1; 3-2011; 45-661542-7951enginfo:eu-repo/semantics/altIdentifier/url/http://www.tandfonline.com/doi/abs/10.1080/15427951.2011.560786info:eu-repo/semantics/altIdentifier/doi/10.1080/15427951.2011.560786info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:27:01Zoai:ri.conicet.gov.ar:11336/14763instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:27:01.471CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Understanding edge connectivity in the internet through core decomposition |
title |
Understanding edge connectivity in the internet through core decomposition |
spellingShingle |
Understanding edge connectivity in the internet through core decomposition Alvarez Hamelin, Jose Ignacio Internet Topology Complex Systems Graph Theory Algorithms |
title_short |
Understanding edge connectivity in the internet through core decomposition |
title_full |
Understanding edge connectivity in the internet through core decomposition |
title_fullStr |
Understanding edge connectivity in the internet through core decomposition |
title_full_unstemmed |
Understanding edge connectivity in the internet through core decomposition |
title_sort |
Understanding edge connectivity in the internet through core decomposition |
dc.creator.none.fl_str_mv |
Alvarez Hamelin, Jose Ignacio Beiro, Mariano Gastón Busch, Jorge R. |
author |
Alvarez Hamelin, Jose Ignacio |
author_facet |
Alvarez Hamelin, Jose Ignacio Beiro, Mariano Gastón Busch, Jorge R. |
author_role |
author |
author2 |
Beiro, Mariano Gastón Busch, Jorge R. |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Internet Topology Complex Systems Graph Theory Algorithms |
topic |
Internet Topology Complex Systems Graph Theory Algorithms |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
The Internet is a complex network composed of several networks: the autonomous systems. Each of them is designed with the aim of transporting information efficiently. This information is carried over routes, which are discovered by routing protocols, such as the border gateway protocol (BGP). The protocols may find possible paths between nodes whenever they exist, or even find paths satisfying specific constraints, e.g., a certain quality of service (QoS). Here, we study connectivity as a network attribute related to both situations; we provide a formal lower bound to it based on core decomposition and low-complexity algorithms to find it. Then we apply these algorithms to analyze maps obtained from the prominent Internet mapping projects, and use the LaNet-vi open-source software for their visualization. Fil: Alvarez Hamelin, Jose Ignacio. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería; Argentina; Argentina Fil: Beiro, Mariano Gastón. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Busch, Jorge R.. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina |
description |
The Internet is a complex network composed of several networks: the autonomous systems. Each of them is designed with the aim of transporting information efficiently. This information is carried over routes, which are discovered by routing protocols, such as the border gateway protocol (BGP). The protocols may find possible paths between nodes whenever they exist, or even find paths satisfying specific constraints, e.g., a certain quality of service (QoS). Here, we study connectivity as a network attribute related to both situations; we provide a formal lower bound to it based on core decomposition and low-complexity algorithms to find it. Then we apply these algorithms to analyze maps obtained from the prominent Internet mapping projects, and use the LaNet-vi open-source software for their visualization. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-03 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/14763 Alvarez Hamelin, Jose Ignacio; Beiro, Mariano Gastón; Busch, Jorge R.; Understanding edge connectivity in the internet through core decomposition; Taylor & Francis; Internet Mathematics; 7; 1; 3-2011; 45-66 1542-7951 |
url |
http://hdl.handle.net/11336/14763 |
identifier_str_mv |
Alvarez Hamelin, Jose Ignacio; Beiro, Mariano Gastón; Busch, Jorge R.; Understanding edge connectivity in the internet through core decomposition; Taylor & Francis; Internet Mathematics; 7; 1; 3-2011; 45-66 1542-7951 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://www.tandfonline.com/doi/abs/10.1080/15427951.2011.560786 info:eu-repo/semantics/altIdentifier/doi/10.1080/15427951.2011.560786 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Taylor & Francis |
publisher.none.fl_str_mv |
Taylor & Francis |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1846082722117713920 |
score |
13.22299 |