Treewidth and Hyperbolicity of the Internet - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Treewidth and Hyperbolicity of the Internet

(1, 2) , (1, 2) , (1, 2, 3)
1
2
3

Abstract

We study the measurement of the Internet according to two graph parameters: treewidth and hyperbolicity. Both tell how far from a tree a graph is. They are computed from snapshots of the Internet released by CAIDA, DIMES, AQUALAB, UCLA, Rocketfuel and Strasbourg University, at the AS or at the router level. On the one hand, the treewidth of the Internet appears to be quite large and being far from a tree with that respect, reflecting some high degree of connectivity. This proves the existence of a well linked core in the Internet. On the other hand, the hyperbolicity (as a graph parameter) appears to be very low, reflecting a tree-like structure with respect to distances. Additionally, we compute the treewidth and hyperbolicity obtained for classical Internet models and compare with the snapshots.
Fichier principal
Vignette du fichier
nca2011treeness.pdf (135.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00909736 , version 1 (26-11-2013)

Identifiers

  • HAL Id : hal-00909736 , version 1

Cite

Fabien de Montgolfier, Mauricio Soto, Laurent Viennot. Treewidth and Hyperbolicity of the Internet. 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA), Aug 2011, Boston, United States. pp.25-32. ⟨hal-00909736⟩
207 View
253 Download

Share

Gmail Facebook Twitter LinkedIn More