Submission deadline 06/22/2006

06/22/2006

Speaker(s) : Dmitri Krioukov, Chercheur CAIDA (USA)

We present a new, systematic approach to analyzing network topologies. We first introduce a series of distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Using this series, we can quantitatively evaluate how close synthetic topologies are to G, construct graphs that accurately reproduce the values of commonly-used graph metrics of G, and provide a rigorous basis for capturing any future metrics that may be of interest. We show that the d=0 and d=1 cases reduce to the known classical (Erdos-Renyi) random graphs and random graphs with prescribed degree distributions respectively. We then construct random graphs for d=0,1,2,3 and demonstrate that these graphs reproduce, with increasing accuracy, important properties of measured and modeled Internet topologies. We find that the d=2 case is sufficient for most practical purposes, while d=3 essentially reconstructs the Internet AS- and router-level topologies exactly.

bamba.gueye (at) nulllip6.fr