Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2009 : graph_annotations
Graph Annotations in Modeling Complex Network Topologies
X. Dimitropoulos, D. Krioukov, A. Vahdat, and G. Riley, "Graph Annotations in Modeling Complex Network Topologies", ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 19, no. 4, pp. 17, Oct 2009.
|   View full paper:    PDF    |  Citation:    BibTeX   |

Graph Annotations in Modeling Complex Network Topologies

Xenofontas Dimitropoulos 4
Dmitri Krioukov 1
Amin Vahdat 2
George Riley 3
1

CAIDA, San Diego Supercomputer Center, University of California San Diego

2

Department of Computer Science and Engineering,
University of California, San Diego

3

Georgia Institute of Technology

4

IBM Research, Zurich

The coarsest approximation of the structure of a complex network, such as the Internet, is a simple undirected unweighted graph. This approximation, however, loses too much detail. In reality, objects represented by vertices and edges in such a graph possess some nontrivial internal structure that varies across and differentiates among distinct types of links or nodes. In this work, we abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a network. Assuming we have this profile measured for a given network, we present an algorithm to rescale it in order to construct networks of varying size that still reproduce the original measured annotation profile.

Using this methodology,we accurately capture the network properties essential for realistic simulations of network applications and protocols, or any other simulations involving complex network topologies, including modeling and simulation of network evolution. We apply our approach to the Autonomous System (AS) topology of the Internet annotated with business relationships between ASs. This topology captures the large-scale structure of the Internet. In depth understanding of this structure and tools to model it are cornerstones of research on future Internet architectures and designs. We find that our techniques are able to accurately capture the structure of annotation correlations within this topology, thus reproducing a number of its important properties in synthetically-generated random graphs.

Keywords: topology
  Last Modified: Wed Oct-11-2017 17:03:56 PDT
  Page URL: http://www.caida.org/publications/papers/2009/graph_annotations/index.xml