A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph

Published

Journal Article

© A K Peters, Ltd. The connectivity of the autonomous systems (ASs) in the Internet can be modeled as a time-evolving random graph, whose nodes represent ASs and whose edges represent direct connections between them. Even though this graph has some random aspects, its properties show it to be fundamentally different from “traditional” random graphs. In the first part of this paper, we use real BGP data to study some properties of the AS connectivity graph and its evolution in time. In the second part, we build a simple model that is inspired by observations made in the first part, and we discuss simulations of this model.

Full Text

Duke Authors

Cited Authors

  • Daubechies, I; Drakakis, K; Khovanova, T

Published Date

  • January 1, 2005

Published In

Volume / Issue

  • 2 / 2

Start / End Page

  • 185 - 246

International Standard Serial Number (ISSN)

  • 1542-7951

Digital Object Identifier (DOI)

  • 10.1080/15427951.2005.10129103

Citation Source

  • Scopus