Treewidth and hyperbolicity of the internet

Proceedings - 2011 IEEE International Symposium on Network Computing and Applications, NCA 2011

Volumn , Issue , 2011, Pages 25-32

  De Montgolfier, Fabien ^a   Soto, Mauricio ^a   Viennot, Laurent ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE OF CONNECTIVITY; GRAPH PARAMETERS; HYPERBOLICITY; INTERNET MODELS; TREE-LIKE STRUCTURES; TREE-WIDTH; TWO-GRAPHS;

INTERNET; PLANT EXTRACTS; TREES (MATHEMATICS);

TELECOMMUNICATION NETWORKS;

EID: 80055011895     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2011.11     Document Type: Conference Paper

References (36)

1. H. L. Bodlaender, "Dynamic programming on graphs with bounded treewidth," in ICALP, 1988, pp. 105-118.
2. Y. Shavitt and T. Tankel, "Hyperbolic embedding of internet graph for distance estimation and overlay construction," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 25-36, 2008. (Pubitemid 351386753)
3. V. Ramasubramanian, D. Malkhi, F. Kuhn, M. Balakrishnan, A. Gupta, and A. Akella, "On the treeness of internet latency and bandwidth," in ACM SIGMETRICS, New York, NY, USA, 2009, pp. 61-72.
4. O. Narayan and I. Saniee, "The large scale curvature of networks," http://arxiv.org/abs/0907.1478v1, 2009.
5. V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, "Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs," in Symposium on Computational Geometry, 2008.
6. V. Chepoi and B. Estellon, "Packing and covering delta-hyperbolic spaces by balls," in APPROX-RANDOM, 2007, pp. 59-73.
7. C. Gavoille and O. Ly, "Distance labeling in hyperbolic graphs," in ISAAC, 2005.
8. V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, Y. Vaxès, and Y. Xiang, "Additive spanners and distance and routing labeling schemes for delta-hyperbolic graphs," To appear in Algorithmica.
9. W. Willinger, D. Alderson, and J. C. Doyle, "Mathematics and the internet: A source of enormous confusion and great potential," Notices of the AMS, vol. 56, no. 5, pp. 586-599, 2009.
10. R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang, "The (in)completeness of the observed internet AS-level structure," IEEE/ACM Transac. on Networking, vol. 18, no. 1, pp. 109-122, 2010.
11. Y. Hyun, B. Huffaker, D. Andersen, E. Aben, M. Luckie, kc claffy, and C. Shanno, "The ipv4 routed /24 as links dataset," 2009.
12. Y. Shavitt and E. Shir, "Dimes: let the internet measure itself," SIG-COMM Comput. Commun. Rev., vol. 35, pp. 71-74, October 2005. (Pubitemid 46323482)
13. K. Chen, D. Choffnes, R. Potharaju, Y. Chen, F. Bustamante, D. Pei, and Y. Zhao, "Where the sidewalk ends: extending the internet as graph using traceroutes from p2p users," in CoNEXT, 2009, pp. 217-228.
14. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, "Measuring isp topologies with rocketfuel," IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 2-16, 2004.
15. P. Mérindol, V. V. den Schrieck, B. Donnet, O. Bonaventure, and J.-J. Pansiot, "Quantifying ases multiconnectivity using multicast information," in Internet Measurement Conference, 2009, pp. 370-376.
16. C. Magnien, F. Ouédraogo, G. Valadon, and M. Latapy, "Fast dynamics in internet topology: preliminary observations and explanations," CoRR, vol. abs/0904.2716, 2009.
17. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree-based vs. structural," in ACM SIGCOMM, 2002, p. 159.
18. J.-J. Pansiot and D. Grad, "On routes and multicast trees in the internet," Computer Communication Review, vol. 28, no. 1, pp. 41-50, 1998. (Pubitemid 128566432)
19. R. Govindan and A. Reddy, "An analysis of internet inter-domain topology and route stability," in IEEE INFOCOM, 1997, pp. 850-857.
20. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," in ACM SIGCOMM, 1999, pp. 251-262. (Pubitemid 32081870)
21. A. Broido and k. claffy, "Internet topology: Connectivity of IP graphs," in Proceedings of SPIE International Symposium on Convergence of IT and Communication, 2001.
22. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "The origin of power-laws in internet topologies revisited," in IEEE INFOCOM, 2002.
23. N. Robertson and P. D. Seymour, "Graph minors. i. excluding a forest," J. Comb. Theory, Ser. B, vol. 35, no. 1, pp. 39-61, 1983.
24. T. S. E. Ng and H. Zhang, "Predicting internet network distance with coordinates-based approaches." in IEEE INFOCOM, 2002.
25. F. Dabek, R. Cox, M. F. Kaashoek, and R. Morris, "Vivaldi: a decentralized network coordinate system." in ACM SIGCOMM, 2004.
26. M. Gromov, "Hyperbolic groups," in Essays in Group Theory, ser. Math. Sciences Research Inst. Springer, 1987, vol. 8.
27. B. D. Abrahao and R. D. Kleinberg, "On the internet delay space dimensionality," in IMC, 2008, pp. 157-168.
28. P. Fraigniaud, E. Lebhar, and L. Viennot, "The inframetric model for the internet," in IEEE INFOCOM, Phoenix, 2008, pp. 1085-1093.
29. A. L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, 1999.
30. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou, "Heuristically optimized trade-offs: A new paradigm for power laws in the internet," in ICALP, 2002, pp. 110-122.
31. W. Willinger, R. Oliveira, and B. Zhang, "Quantifying the completeness of the observed internet as-level structure abstract," UCLA, East Lansing, Michigan, Tech. Rep. TR 080026, September 2008.
32. S. Arnborg, D. G. Corneil, and A. Proskurowski, "Complexity of finding embeddings in a $k$-tree," SIAM Journal on Algebraic and Discrete Methods, vol. 8, no. 2, pp. 277-284, 1987.
33. B. Reed, "Tree width and tangles: A new connectivity measure and some applications," Surveys in combinatorics, vol. 241, pp. 87-162, 1997.
34. D. V. Krioukov, K. R. Fall, and X. Yang, "Compact routing on internetlike graphs." in IEEE INFOCOM, 2004.
35. D. V. Krioukov, K. Claffy, K. Fall, and A. Brady, "On compact routing for the internet," ACM SIGCOMM, vol. 37, no. 3, 2007.
36. F. Viger and M. Latapy, "Efficient and simple generation of random simple connected graphs with prescribed degree sequence," in Computing and Combinatorics, ser. LNCS, 2005, vol. 3595, ch. 45, pp. 440-449. (Pubitemid 41450222)