On the Emergence of Highly Variable Distributions in the Autonomous System Topology


Autoria(s): Fayed, Marwan; Krapivsky, Paul; Byers, John; Finkel, David; Redner, Sid; Crovella, Mark
Data(s)

20/10/2011

20/10/2011

01/03/2003

Resumo

Recent studies have noted that vertex degree in the autonomous system (AS) graph exhibits a highly variable distribution [15, 22]. The most prominent explanatory model for this phenomenon is the Barabási-Albert (B-A) model [5, 2]. A central feature of the B-A model is preferential connectivity—meaning that the likelihood a new node in a growing graph will connect to an existing node is proportional to the existing node’s degree. In this paper we ask whether a more general explanation than the B-A model, and absent the assumption of preferential connectivity, is consistent with empirical data. We are motivated by two observations: first, AS degree and AS size are highly correlated [11]; and second, highly variable AS size can arise simply through exponential growth. We construct a model incorporating exponential growth in the size of the Internet, and in the number of ASes. We then show via analysis that such a model yields a size distribution exhibiting a power-law tail. In such a model, if an AS’s link formation is roughly proportional to its size, then AS degree will also show high variability. We instantiate such a model with empirically derived estimates of growth rates and show that the resulting degree distribution is in good agreement with that of real AS graphs.

National Science Foundation (ANI-9986397, CAREER award ANI-00932996, DMR9978902); Army Research Office (DAAD19-99-1-0173)

Identificador

http://hdl.handle.net/2144/1501

Idioma(s)

en_US

Publicador

Boston University Computer Science Department

Relação

BUCS Technical Reports;BUCS-TR-2003-005

Tipo

Technical Report