CAIDA Home
 papers | presentations | animations | visualizations | bibliography  
 www.caida.org > publications : papers : 2005 : : top_modeling_as
    visit     contact     search:
CAIDA: Cooperative Association for Internet Data Analysis
Towards a Topology Generator Modeling AS Relationships

-----summary of contents-----
Abstract for "Towards a Topology Generator Modeling AS Relationships" authored by Xenofontas Dimitropoulos and George Riley and Dima Krioukov and Ravi Sundaram. Presented at the IEEE ICNP in 2005.
|  View full paper:    PDF  |

-----end summary of contents-----

Towards a Topology Generator Modeling AS Relationships
Presented at the IEEE ICNP in 2005

Xenofontas Dimitropoulos
Georgia Tech and Cooperative Association for Internet Data Analysis - CAIDA

George Riley
Georgia Tech

Dima Krioukov
Cooperative Association for Internet Data Analysis - CAIDA

Ravi Sundaram
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.

|  View full paper:    PDF  |

Cooperative Association for Internet Data Analysis (CAIDA)
  Last Modified: Mon Apr-10-2006 17:22:33 PDT
  Maintained by: Alex Ma
  Page URL: http://www.caida.org/publications/papers/2005/top_modeling_as/index.xml