Understanding edge-connectivity in the Internet through core-decomposition

Abstract : Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partitions and selected paths) this work provides a formal lower bound to it based on core-decomposition, under certain conditions, and low complexity algorithms to find it. We apply them to analyze maps obtained from the prominent Internet mapping projects, using the LaNet-vi open-source software for its visualization.
Type de document :
Article dans une revue
Internet Mathematics, Taylor & Francis, 2011, 7 (1), pp.45-66. 〈10.1080/15427951.2011.560786〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00439597
Contributeur : José Ignacio Alvarez-Hamelin <>
Soumis le : mardi 8 décembre 2009 - 00:02:08
Dernière modification le : mercredi 22 août 2018 - 12:02:01
Document(s) archivé(s) le : jeudi 17 juin 2010 - 21:17:18

Fichiers

k-core-connected.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

José Ignacio Alvarez-Hamelin, Beiró Mariano Gastón, Jorge Rodolfo Busch. Understanding edge-connectivity in the Internet through core-decomposition. Internet Mathematics, Taylor & Francis, 2011, 7 (1), pp.45-66. 〈10.1080/15427951.2011.560786〉. 〈inria-00439597〉

Partager

Métriques

Consultations de la notice

161

Téléchargements de fichiers

124