Inside BGP tables: Inferring autonomous system's interconnectivity

Abstract

In this paper we address the problem of Autonomous System (AS) interconnectivity. We analyze the union of six BGP Tables taken from different places. The union of BGP tables from several AS's gives a richer perspective in terms of number of AS's and inter-domain links discovered. We infer AS relationships using well-known heuristics. Once we have the AS relationships we can obtain the AS's that form the regional area of the Internet eliminating the end customers. Pruning the heuristic we obtain AS's that form the core of the Internet. We, then, can study whether the set of AS's in the regional and core sub-graphs and the in-degree and out-degree distributions follow power-laws. Our results show that the In-degree CCDF fits well a power-law in all the graphs defined. However, the Degree CCDF only fits a power-law for the whole graph. For the regional and core sub-graphs the Degree CCDF is better fitted with a Go Model. The Out-degree CCDF for these sub-graphs are well fitted with a power-law only for the first hundred of neighbors. © Springer-Verlag 2004.