Relevance of massively distributed explorations of the Internet topology: Qualitative results

Computer Networks

Volumn 50, Issue 16, 2006, Pages 3197-3224

  Guillaume, Jean Loup ^a   Latapy, Matthieu ^a   Magoni, Damien ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b University Hospital Strasbourg   (France)

Author keywords

Active measurements; Graphs; Internet topology; Metrology

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; MEASUREMENT THEORY; QUALITY CONTROL; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; STATISTICAL METHODS;

INTERNET TOPOLOGY; STATISTICAL PROPERTIES; TRACEROUTE TOOL;

INTERNET;

EID: 33747891218     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.12.010     Document Type: Article

References (64)

1. D. Achlioptas, A. Clauset, D. Kempe, C. Moore, On the bias of traceroute sampling, or: Why almost every network looks like it has a power law, in: ACM Symposium on Theory of Computing (STOC2005), 2005.
2. Albert R., and Barabási A.-L. Emergence of scaling in random networks. Science 286 (1999) 509-512
3. Albert R., and Barabási A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics 74 (2002) 47
4. Albert R., Jeong H., and Barabási A.-L. Error and attack tolerance in complex networks. Nature 406 (2000) 378-382
5. P. Barford, A. Bestavros, J. Byers, M. Crovella, On the marginal utility of network topology measurements, in: ACM SIGCOMM Internet Measurement Workshop 2001, San Francisco, CA, November 2001. ACM SIGCOMM.
6. Bender E., and Caneld E. The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory, Ser. A 24 (1978) 296-307
7. Bollobás B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J Combin. 1 (1980) 311-316
8. Bollobás B. Random Graphs (1985), Academic Press
9. T. Bu, D. Towsley, On distinguishing between internet power law topology generators, in: INFOCOM, 2002.
10. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, The origin of power laws in internet topologies revisited, in: INFOCOM, 2002.
11. F. Chung, L. Lu, The average distances in random graphs with given expected degrees, 2002.
12. K. Claffy, T. Monk, D. McRobb, Internet tomography, Nature Magazine, Web Matters. Available from: .
13. Clauset A., and Moore C. Accuracy and scaling phenomena in internet mapping. Phys. Rev. Lett. 94 (2005) 018701
14. Cohen R., Erez K., ben Avraham D., and Havlin S. Resilience of the internet to random breakdown. Phys. Rev. Lett. 85 (2000) 4626-4628
15. Cohen R., Erez K., ben Avraham D., and Havlin S. Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86 (2001) 3682-3685
16. Cohen R., and Havlin S. Scale-free networks are ultrasmall. Phys. Rev. Lett. 90 (2003) 058701
17. L. Dall'Asta, J.I. Alvarez-Hamelin, A. Barrat, A. Vazquez, A. Vespignan, A statistical approach to the traceroute-like exploration of networks: theory and simulations, in: Workshop on Combinatorial and Algorithmic Aspects of Networking, 2004.
18. L. Dall'Asta, J.I. Alvarez-Hamelin, A. Barrat, A. Vazquez, A. Vespignan, A statistical approach to the traceroute-like exploration of networks: theory and simulations, Special issue of Theoretical Computer Science on Complex Networks, 2005.
19. Dorogovtsev S.N., and Mendes J.F.F. Evolution of networks. Adv. Phys. 51 (2002) 1079-1187
20. Dorogovtsev S.N., Mendes J.F.F., and Samukhin A. Structure of growing networks with preferential linking. Phys. Rev. Lett. 85 (2000) 4633-4636
21. Dorogovtsev S.N., Mendes J.F.F., and Samukhin A.N. Metric structure of random networks. Nucl. Phys. B 653 (2003) 307
22. Erdös P., and Rényi A. On random graphs I. Publ. Math. Debrecen 6 (1959) 290-297
23. A. Fabrikant, E. Koutsoupias, C.H. Papadimitriou, Heuristically optimized trade-offs: A new paradigm for power laws in the internet, in: ICALP, 2002.
24. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in: SIGCOMM, 1999, pp. 251-262.
25. Cooperative Association for Internet Data Analysis. Available from: .
26. Cooperative Association for Internet Data Analysis Skitter tool. Available from: .
27. Internet Maps from Mercator. Available from: .
28. R. Govindan, H. Tangmunarunkit, Heuristics for internet map discovery, in: IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, IEEE, pp. 1371-1380.
29. J.-L. Guillaume, M. Latapy, Bipartite graphs as models of complex networks, in: Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 2004.
30. Guillaume J.-L., and Latapy M. Bipartite structure of all complex networks. Inform. Process. Lett. 90 5 (2004) 215-221
31. J.-L. Guillaume, M. Latapy, Complex network metrology, Complex systems, 2005.
32. J.-L. Guillaume, M. Latapy, Relevance of massively distributed explorations of the internet topology: simulation results, in: IEEE Infocom 2005, 2005.
33. Y. Hyun, A. Broido, K. Claffy, Traceroute and BGP AS path incongruities. Available from: .
34. C. Jin, Q. Chen, S. Jamin, Inet: Internet topology generator. Technical Report CSE-TR-443-00, Department of EECS, University of Michigan, 2000.
35. A. Lakhina, J. Byers, M. Crovella, P. Xie, Sampling biases in IP topology measurements, in: IEEE INFOCOM, 2003.
36. J. Leguay, M. Latapy, T. Friedman, K. Salamatian, Describing and simulating internet routes, in: Networking, 2005.
37. L. Lu, The diameter of random massive graphs, in: ACM-SIAM, 12th Ann. Symposium on Discrete Algorithms (SODA), 2001, pp. 912-921.
38. Luczak T. Sparse random graphs with a given degree sequence. In: Frieze A.M., and Luczak T. (Eds). Random Graphs vol. 2 (1992), Wiley, New York 165-182
39. Magoni D., and Pansiot J.-J. Analysis of the autonomous system network topology. ACM SIGCOMM Comput. Commun. Rev. 31 3 (2001) 26-37
40. D. Magoni, J.-J. Pansiot, Internet topology modeler based on map sampling, in: Proceedings of ISCC'02, IEEE Symposium on Computers and Communications, Italy, July 2002.
41. D. Magoni, J.-J. Pansiot, Influence of network topology on protocol simulation, in: ICN'01-1st IEEE International Conference on Networking, Lecture Notes in Computer Science, vol. 2093, July 9-13, 2001, pp. 762-770.
42. D. Magoni, nec (network cartographer). Available from: .
43. Magoni D. Tearing down the internet. IEEE J. Selected Areas Commun. 21 (2003) 949-960
44. Magoni D., and Hoerdt M. Internet core topology mapping and analysis. Comput. Commun. 28 (2005) 494-506
45. Medina A., Matta I., and Byers J. On the origin of power laws in internet topologies. ACM Comput. Commun. Rev. 30 2 (2000) 18-28
46. Molloy M., and Reed B. A critical point for random graphs with a given degree sequence. Random Struct. Algorithms (1995) 161-179
47. Molloy M., and Reed B. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. (1998) 295-305
48. Newman M.E.J., Watts D.J., and Strogatz S.H. Random graph models of social networks. Proc. Natl. Acad. Sci. USA 99 Suppl. 1 (2002) 2566-2572
49. Norros I., and Reittu H. On the power-law random graph model of massive data networks. Source Perform. Eval. Arch. 55 1-2 (2004) 3-23
50. Pansiot J., and Grad D. On routes and multicast trees in the internet. ACM Comput. Commun. Rev. 28 1 (1998) 41-50
51. Pastor-Satorras R., and Vespignani A. Evolution and Structure of the Internet: A Statistical Physics Approach (2004), Cambridge University Press
52. Petermann T., and De Los Rios P. Exploration of scale-free networks. Eur. Phys. J. B 38 (2004) 201
53. DIMES@home Project. Available from: .
54. MetroSec Project. Available from: .
55. Traceroute@Home Project. University of Paris 6, Timur friedman. Available from: .
56. P. De Los Rios, Exploration bias of complex networks, in: Proceedings of the 7th Conference on Statistical and Computational Physics Granada, 2002.
57. N. Spring, R. Mahajan, D. Wetherall, Measuring ISP topologies with rocketfuel, in: Proceedings of ACM/SIGCOMM'02, August 2002.
58. Strogatz S.H. Exploring complex networks. Nature 410 (2001)
59. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, On characterizing network hierarchy. Technical Report 03-782, Computer Science Department, University of Southern California, submitted for publication.
60. R. van der Hofstad, G. Hooghiemstra, D. Znamenski, Distances in random graphs with finite mean and infinite variance degrees.
61. R. van der Hofstad, G. Hooghiemstra, D. Znamenski, Random graphs with arbitrary i.i.d. degrees.
62. A. Vazquez, R. Pastor-Satorras, A. Vespignani, Internet topology at the router and autonomous system level [cond-mat/0206084].
63. Waxman B.M. Routing of multipoint connections. IEEE J. Selected Areas Commun. (1988) 1617-1622
64. Zegura E.W., Calvert K.L., and Donahoo M.J. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Trans. Networking 5 6 (1997) 770-783