Artículo
Understanding edge connectivity in the internet through core decomposition
Fecha de publicación:
03/2011
Editorial:
Taylor & Francis
Revista:
Internet Mathematics
ISSN:
1542-7951
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Palabras clave:
Internet Topology
,
Complex Systems
,
Graph Theory
,
Algorithms
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(INTECIN)
Articulos de INST.D/TEC.Y CS.DE LA ING."HILARIO FERNANDEZ LONG"
Articulos de INST.D/TEC.Y CS.DE LA ING."HILARIO FERNANDEZ LONG"
Citación
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
Compartir
Altmétricas