A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph
Publication
, Journal Article
Daubechies, I; Drakakis, K; Khovanova, T
Published in: Internet Mathematics
January 1, 2005
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.
Duke Scholars
Published In
Internet Mathematics
DOI
ISSN
1542-7951
Publication Date
January 1, 2005
Volume
2
Issue
2
Start / End Page
185 / 246
Citation
APA
Chicago
ICMJE
MLA
NLM
Daubechies, I., Drakakis, K., & Khovanova, T. (2005). A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph. Internet Mathematics, 2(2), 185–246. https://doi.org/10.1080/15427951.2005.10129103
Daubechies, I., K. Drakakis, and T. Khovanova. “A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph.” Internet Mathematics 2, no. 2 (January 1, 2005): 185–246. https://doi.org/10.1080/15427951.2005.10129103.
Daubechies I, Drakakis K, Khovanova T. A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph. Internet Mathematics. 2005 Jan 1;2(2):185–246.
Daubechies, I., et al. “A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph.” Internet Mathematics, vol. 2, no. 2, Jan. 2005, pp. 185–246. Scopus, doi:10.1080/15427951.2005.10129103.
Daubechies I, Drakakis K, Khovanova T. A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph. Internet Mathematics. 2005 Jan 1;2(2):185–246.
Published In
Internet Mathematics
DOI
ISSN
1542-7951
Publication Date
January 1, 2005
Volume
2
Issue
2
Start / End Page
185 / 246