Skip to Main content Skip to Navigation
Conference papers

Treewidth and Hyperbolicity of the Internet

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Tuesday, November 26, 2013 - 5:27:08 PM
Last modification on : Friday, January 21, 2022 - 3:14:01 AM
Long-term archiving on: : Thursday, February 27, 2014 - 10:56:11 AM


Files produced by the author(s)


  • HAL Id : hal-00909736, version 1


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⟩



Les métriques sont temporairement indisponibles