Comparing the Structure of Power-Law Graphs and the Internet AS Graph

  • Authors:
  • Sharad Jaiswal;Arnold L. Rosenberg;Don Towsley

  • Affiliations:
  • Univ. of Massachusetts, Amherst;Univ. of Massachusetts, Amherst;Univ. of Massachusetts, Amherst

  • Venue:
  • ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work we devise algorithmic techniques to compare the interconnection structure of the Internet AS Graph with that of graphs produced by topology generators that match the power-law degree distribution of the AS graph. We are guided by the existing notion that nodes in the AS graph can be placed in tiers with the resulting graph having an hierarchical structure. Our techniques are based on identifying graph nodes at each tier, decomposing the graph by removing such nodes and their incident edges, and thus explicitly revealing the interconnection structure of the graph. We define quantitative metrics to analyze and compare the decomposition of synthetic power-law graphs with the Internet-AS graph. Through experiments, we observe qualitative similarities in the decomposition structure of the different families of power-law graphs and explain any quantitative differences based on their generative models. We believe our approach provides insight into the interconnection structure of the AS graph and will find continuing applications in evaluating the representativeness of synthetic topology generators.