# msv11b

### Summary

de Montgolfier, Fabien, Soto, Mauricio and Viennot, Laurent (2011) Treewidth and Hyperbolicity of the Internet. In 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA). Boston, aug, pages 25-32. (PDF)

### 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.

### Bibtex entry

@INPROCEEDINGS { msv11b,    AUTHOR = { de Montgolfier, Fabien and Soto, Mauricio and Viennot, Laurent },    TITLE = { Treewidth and Hyperbolicity of the Internet },    BOOKTITLE = { 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA) },    PAGES = { 25-32 },    YEAR = { 2011 },    MONTH = { aug },    ADDRESS = { Boston },    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. },    PDF = { http://gang.inria.fr/~viennot/publis/articles/nca2011treeness.pdf },}