Complex network measurements: Estimating the relevance of observed properties

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 2333-2341

  Latapy, Matthieu ^a   Magnien, Clémence ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; INFOCOM;

KETONES;

EID: 51349112266     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.227     Document Type: Conference Paper

References (44)

1. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internez topology," in ACM SIGCOMM, 1999.
2. C. Gkantsidis, M. Mihail, and E. Zegura, "Spectral analysis of internet topologies," in IEEE INFOCOM, 2003.
3. J.-J. P. D. Magoni, "Analysis of the autonomous system network topology," ACM/SIGCOMM Computer Communication Review, vol. 31, no. 3, 2001.
4. "Caida -skitter project," http://www.caida.org/tools/ measurement/skitter/.
5. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins, "The Web as a graph: Measurements, models, and methods," in COCOON, 1999.
6. A. Broder, S. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener, "Graph structure in the web," Computer Networks, vol. 33, 2000.
7. P. Boldi and S. Vigna, "The webgraph framework i: compression techniques," in WWW, 2004.
8. _, "The webgraph framework ii: Codes for the world-wide web," in DCC, 2004.
9. "Webgraph project," http://webgraph.dsi.unimi.it/.
10. S. Handurukande, A.-M. Kermarrec, F. L. Fessant, and L. Massoulié "Exploiting semantic clustering in the edonkey p2p network," in ACM SIGOPS, 2004.
11. S. Voulgaris, A.-M. Kermarrec, L. Massoulié, and M. van Steen, "Exploiting semantic proximity in peer-to-peer content searching," in IEEE FTDCS, 2004.
12. S. Le-Blond, M. Latapy, and J.-L. Guillaume, "Statistical analysis of a p2p query graph based on degrees and their time evolution," in IWDC, 2004.
13. J.-L. Guillaume, S. Le-Blond, and M. Latapy, "Clustering in p2p exchanges and consequences on performances," in IPTPS, 2005.
14. D. Watts and S. Strogatz, "Collective dynamics of small-world networks;' Nature, vol. 393, 1998.
15. R. Albert, H. Jeong, and A.-L. Barabasi, "Diameter of the world wide web.' Nature, vol. 401, 1999.
16. R. Albeit, H. Jeong, and A.-L. Barabisi, "Error and attack tolerance in complex networks," Nature, vol. 406, 2000.
17. M. Kim and M. Medard, "Robustness in large-scale random networks," in IEEE INFOCOM, 2004.
18. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scale-free networks," Phys. Rev. Let., vol. 86, 2001.
19. A. Ganesh, L. Massoulie, and D. Towsley, "The effect of network topology on the spread of epidemics," in IEEE INFOCOM, 2005.
20. Z. Li and P. Mohapatra, "Impact of topology on overlay routing service," in IEEE INFOCOM, 2004.
21. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to universal topology generation," in Proc. MASCOTS, 2001, http://www.cs.bu.edu/brite/.
22. U. Brandes and T. Erlebach, Eds.. Network Analysis: Methodological Foundations. LNCS, Springer-Verlag. 2005.
23. S. Bornholdt and H. Schuster, Eds., Hankbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, 2003.
24. A. Lakhina, J. Byers, M. Crovella, and P. Xie, "Sampling biases in ip topology measurements," in IEEE INFOCOM, 2003.
25. P. Barford, A. Bestavros, J. Byers, and M. Crovella, "On the marginal utility of network topology measurements," in ACM/SIGCOMM IMC, 2001.
26. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, "On the bias of traceroute sampling," in ACM STOC, 2005.
27. J.-L. Guillaume and M. Latapy, "Relevance of massively distributed explorations of the internez topology: Simulation results," in IEEE INFOCOM, 2005.
28. L. Dall' Asta, J. Alvarez-Hamelin, A. Barrat, A. Vazquez, and A. Vespignani, "A statistical approach to the traceroute-like exploration of networks: theory and simulations," in CRAN, 2004.
29. "Data and program - authors' web page," http://www.liafa. jussieu.fr/~latapy/Measurement/.
30. "Metrosec project," http://www2.laas.fr/METROSEC/.
31. "Laar laboratory," http://www.laas.fr/laas/.
32. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: Densification laws, shrinking diameters and possible explanations," in ACM SIGKDD, 2005.
33. S. Dorogovtsev and J. Mendes, Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH. 2002, ch. Accelerated growth of networks.
34. U. Zwick, "Exact and approximate distances in graphs - A survey," in ESA, vol. 2161, 2001.
35. D. Eppstein and J. Wang, "Fast approximation of centrality," Journal of Graph Algorithms and Applications, vol. 8 (1). 2004.
36. D. Corneil, F. Dragan, and E. Khler, "On the power of bfs to determine a graph's diameter," Networks, vol. 42 (4), 2003.
37. D. Cornell, F. Dragan, M. Habib, and C. Paul, "Diameter determination on restricted graph families," Discrete Applied Mathematics, vol. 113, no. 2-3, 2001.
38. C. Magnien, M. Latapy, and M. Habib, "Fast computation of empirically tight bounds for the diameter of massive graphs," 2007, submitted.
39. B. Bollobas. Random Graphs. Cambridge University Press, 2001.
40. M. Newman, D. Watts, and S. Strogatz, "Random graphs with arbitrary degree distributions and their applications.' Phys. Rev. E. 2001.
41. M. L. Goldstein, S. A. Morris, and G. G. Yen, "Problems with fitting to the power-law distribution," European Physics Journal B, vol. 41, 2004.
42. M. Newman, "Power laws, pareto distributions and zipf's law," Contemporary Physics, vol. 46, pp. 323-351, 2005, tond-mat/0412004.
43. T. Schank and D. Wagner, "Finding, counting and listing all triangles in large graphs, an experimental study," in WEA, 2005.
44. M. Latapy, "Theory and practice of triangle problems in very large (sparse (power-law)) graphs," 2006. submitted.