Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2005 : top_modeling_as
Towards a Topology Generator Modeling AS Relationships
X. Dimitropoulos, G. Riley, D. Krioukov, and R. Sundaram, "Towards a Topology Generator Modeling AS Relationships", in IEEE International Conference on Network Protocols, Nov 2005.
|   View full paper:    PDF    |  Citation:    BibTeX   |

Towards a Topology Generator Modeling AS Relationships

Xenofontas Dimitropoulos 1, 2
George Riley 2
Dmitri Krioukov 1
Ravi Sundaram 3
1

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

2

Georgia Institute of Technology

3

Northeastern University

The development of realistic topology generators is a problem that has attracted significant attention the last few years. There exist a number of competing approaches to construction of random graphs reproducing important properties of real networks. Unfortunately, all the existing approaches do not capture an inherent aspect of many real networks: links in real networks represent relationships, which can be of several types reflecting different properties. Such link type inhomogeneity is present in the AS topology of the Internet, which is a intermix of customer-to- provider (c2p), peer-to-peer (p2p) and sibling-to-sibling (s2s) relationships. It also exists in social networks (different types of social relationships), in biological networks (different types of protein interactions) and in many other real networks. Node relationships not only provide additional information on the network topology structure, but more significantly, they represent an indispensable aspect of real networks, and this aspect needs to be properly modeled for many practical applications. Consider for example the case of using synthetic AS topologies to simulate a new routing protocol. In order to realistically simulate routing in a synthetic AS topology, we need to take into account how policies affect routing decisions. However, this is not possible with existing topology generators since they solely model the network connectivity properties without incorporating any insight about the relationships between nodes. In this work we address this problem by introducing a framework for modeling different relationships found in real networks. We use our framework to model AS relationships in the Internet and to develop an AS topology generator that generates AS graphs with realistic connectivity properties as well as realistic AS relationships.

Keywords: routing, topology
  Last Modified: Wed Oct-11-2017 17:03:52 PDT
  Page URL: http://www.caida.org/publications/papers/2005/top_modeling_as/index.xml