CAIDA Home
 papers | presentations | animations | visualizations | bibliography  
 www.caida.org > publications : papers : 2006 : : modeling_as
    visit     contact     search:
CAIDA: Cooperative Association for Internet Data Analysis
Modeling Autonomous System Relationships

-----summary of contents-----
Abstract for "Modeling Autonomous System Relationships" authored by Xenofontas Dimitropoulos and George Riley. To be presented at the 20th Principles of Advanced and Distributed Simulation (PADS) in 2006.
|  View full paper:    PDF  |

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

Modeling Autonomous System Relationships
To be presented at the 20th Principles of Advanced and Distributed Simulation (PADS) in 2006

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

George Riley
Georgia Tech

The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocols. Despite the volume of research in this area the last several years, current topology generators fail to capture an inherent aspect of the autonomous system (AS) topology of the Internet, namely the fact that AS links reflect business agreements between competing entities, which impose restrictions on how traffic is routed between ASs. These restrictions result in inflated AS paths and generally in suboptimal routing in the Internet. In this work, we first evaluate the importance of modeling AS relationships when conducting accurate and realistic simulation studies. We demonstrate that ignoring AS relationships produces different simulation results than modeling AS relationships based on known relationships between Internet Internet Service Providers (ISPs). Then, we introduce a framework for generating synthetic AS topologies annotated with realistic relationships. In addition to modeling the degree distribution of a network, which is the property that most existing topology generators model, our framework also models new properties that capture the characteristics of AS relationships. Finally, we propose a novel algorithm for generating synthetic graphs, annotated with AS relationships, that reproduce these AS relationships-aware properties.

|  View full paper:    PDF  |

Cooperative Association for Internet Data Analysis (CAIDA)
  Last Modified: Tues Apr-11-2006 15:5:50 PDT
  Maintained by: Alex Ma
  Page URL: http://www.caida.org/publications/papers/2006/modeling_as/index.xml