Relevance of massively distributed explorations of the internet topology: Simulation results

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 1084-1094

  Guillaume, Jean Loup ^a   Latapy, Matthieu ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Graph theory; Network measurements; Simulations

Indexed keywords

COMPUTER SIMULATION; DATA REDUCTION; GRAPH THEORY; MAPS; NETWORKS (CIRCUITS); TOPOLOGY;

INTERNET MAPS; NETWORK MEASUREMENTS; TRACEROUTE TOOLS;

INTERNET;

EID: 25844457427     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. R. Albert and A.-L. Barabási. Emergence of scaling in random networks. Science, 286:509-512, 1999.
2. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47, 2002.
3. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance in complex networks. Nature, 406:378-382, 2000.
4. Paul Barford, Azer Bestavros, John Byers, and Mark Crovella. On the marginal utility of network topology measurements. In ACM SIGCOMM Internet Measurement Workshop 2001, San Francisco, CA, November 2001. ACM SIGCOMM.
5. B. Bollobás. Random Graphs. Academic Press, 1985.
6. T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In INFOCOM, 2002.
7. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The origin of power laws in internet topologies revisited. In INFOCOM, 2002.
8. K. Claffy, T. Monk, and D. McRobb. Internet tomography. Nature Magazine, Web Matters, http://helix.nature.com/webmatters/tomog/tomog.html.
9. A. Clauset and C. Moore. Traceroute sampling makes random graphs appear to have power law degree distributions, cond-mat/0312674.
10. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin. Resilience of the internet to random breakdown. Phys. Rev. Lett., 85:4626-4628, 2000.
11. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin. Breakdown of the internet under intentional attack. Phys. Rev. Lett., 86:3682-3685, 2001.
12. L. Dall'Asta, I. Alvarez-Hamelin, A. Barrat, A. Vasquez, and A. Vespignani. A statistical approach to the traceroute-like exploration of networks: theory and simulations, cond-mat/0406404.
13. S.N. Dorogovtsev and J.F.F. Mendes. Evolution of networks. Adv. Phys. 51, 1079-1187, 2002.
14. S.N. Dorogovtsev, J.F.F. Mendes, and A. Samukhin. Structure of growing networks with preferential linking. Phys. Rev. Lett. 85, pages 4633-4636, 2000.
15. P. Erdös and A. Rényi. On random graphs I. Publ. Math. Debrecen, 6:290-297, 1959.
16. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
17. Cooperative Association for Internet Data Analysis. http://www.caida.org/ .
18. Cooperative Association for Internet Data Analysis Skitter tool. http://www.caida.org/tools/measurement/skitter/.
19. T. Friedman, M. Latapy, J. Leguay, and K. Salamatian. What is a route on the internet. preprint.
20. Internet Maps from Mercator. http://www.isi.edu/div7/scan/mercator/maps. html.
21. R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In IEEE INFOCOM 2000, pages 1371-1380, Tel Aviv, Israel. March 2000. IEEE.
22. J.-L. Guillaume and M. Latapy. Bipartite graphs as models of complex networks. preprint - http://www.liafa.jussieu.fr/latapy/Publis/, 2004.
23. J.-L. Guillaume and Matthieu Latapy. Complex network metrology. 2004. preprint - http://www.liafa.jussieu.fr/latapy/Publis/.
24. Y. Hyun, A. Broido, and K. Claffy. Traceroute and BGP AS path incongruities. http://www.caida.org/outreach/papers/2003/ASP/.
25. A. Lakhina, J. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In IEEE INFOCOM, 2003.
26. L. Lu. The diameter of random massive graphs. In ACM-SIAM, editor, 12th Ann. Symp. on Discrete Algorithms (SODA), pages 912-921, 2001.
27. T. Luczak. Sparse random graphs with a given degree sequence, in Random Graphs, vol. 2, A.M. Frieze, T. uczak eds. Wiley, New York, 1992. pages. 165-182.
28. D. Magoni and J.-J. Pansiot. Analysis of the autonomous system network topology. ACM SIGCOMM Computer Communication Review, 31(3):26-37, July 2001.
29. D. Magoni and J.-J. Pansiot. Internet topology modeler based on map sampling. In Proceedings of ISCC'02, IEEE Symposium on Computers and Communications, Italy, July 2002.
30. D. Magoni and J.-J. Pansiot. Influence of network topology on protocol simulation. In ICN'01 - 1st IEEE International Conference on Networking, volume Lecture Notes in Computer Science, pages 762-770, July 9-13, 2001.
31. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, pages 161-179, 1995.
32. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., pages 295-305, 1998.
33. M.E.J. Newman, D.J. Watts, and S.H. Strogatz. Random graph models of social networks. Proc. Natl. Acad. Sci. USA, 99 (Suppl. 1):2566-2572, 2002.
34. J.-J. Pansiot and D. Grad. On routes and multicast trees in the internet. ACM Computer Communication Review, 28(1):41-50, 1998.
35. R. Pastor-Satorras and A. Vespignani. Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge University Press, 2004.
36. T. Petermann and P. De Los Rios. Exploration of scale-free networks. To appear in Eur. Phys. J. B, 2004.
37. DIMES @home Project, http://www.cs.huji.ac.il/eproj/available/dimes.
38. Traceroute@Home project. University of Paris 6. coordinator: Timur friedman.
39. P. De Los Rios. Exploration bias of complex networks. In Proceedings of the 7th Conference on Statistical and Computational Physics Granada, 2002.
40. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with rocketfuel. In Proceedings of ACM/SIGCOMM '02, August 2002.
41. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. On characterizing network hierarchy. Technical Report 03-782, Computer Science Department, University of Southern California, 2001. submitted.
42. A. Vazquez, R. Pastor-Satorras, and A. Vespignani. Internet topology at the router and autonomous system level, [cond-mat/0206084].
43. B.M. Waxman. Routing of multipoint connections. IEEE Journal of Selected Areas in Communications, pages 1617-1622, 1988.
44. E.W. Zegura, K.L. Calvert, and M.J. Donahoo. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Transactions on Networking, 5(6):770-783, 1997.