Measuring the effectiveness of the s-metric to produce better network models

Recent research has shown that while many complex networks follow a power-law-distribution for their node degrees, it is not sufficient to model these networks based only on their degree distribution. In order to better distinguish between these networks, the metric s was introduced to measure how interconnected the hub nodes are in a network. We examine the effectiveness of creating network models based on this metric. Through a series of computational experiments, we compare how well a set of common structural network metrics are preserved between instances of the autonomous system Internet topology and a series of random models with identical degree sequences and similar s values. We demonstrate that creating models based on the s metric can produce moderate improvement in structural characteristics over strictly using degree distribution. Our results also indicate that some interesting relationships exist between the s metric and the various structural metrics.

[1]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms (Working Paper) , 1971, SWAT.

[2]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[3]  Neo D. Martinez,et al.  Simple rules yield complex food webs , 2000, Nature.

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  J. Kurchan,et al.  The collective dynamics , 1990 .

[6]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[7]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[8]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM 2002.

[9]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[10]  James Noble,et al.  Scale-free geometry in OO programs , 2005, CACM.

[11]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[12]  GovindanRamesh,et al.  Network topology generators , 2002 .

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[14]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[15]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[16]  Brian Cloteaux,et al.  Generating Network Models Using the S-Metric , 2008, MSV.

[17]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  D. Richard Kuhn,et al.  Study of BGP Peering Session Attacks and Their Impacts on Routing Performance , 2006, IEEE Journal on Selected Areas in Communications.

[20]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.