Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2007 : as_relationships_inference
AS Relationships: Inference and Validation
X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, k. claffy, and G. Riley, "AS Relationships: Inference and Validation", ACM SIGCOMM Computer Communication Review (CCR), vol. 37, no. 1, pp. 29--40, Jan 2007.
|   View full paper:    DOI    PDF    |  Citation:    BibTeX   |

AS Relationships: Inference and Validation

Xenofontas Dimitropoulos 1, 2
Dmitri Krioukov 1
Marina Fomenkov 1
Bradley Huffaker 1
Young Hyun 1
kc claffy 1
George Riley 2
1

CAIDA, San Diego Supercomputer Center, University of California San Diego

2

Georgia Institute of Technology

Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and complete knowledge of the nature and structure of the contractual relationships between Autonomous Systems (ASs). In this work, we first examine the state-of-the-art in inferring AS relationships. We carefully analyze existing techniques and pinpoint limitations and inadequacies associated with them. We then introduce new, improved heuristics addressing the problems we have identified. Seeking to increase the value and reliability of our inference results, we then proceed to direct validation. We perform a survey with ASs' network administrators to collect information on the actual connectivity and policies of the surveyed ASs. Based on the survey results, we find that our new AS relationship inference techniques achieve high levels of accuracy: we correctly infer 96.5% customer to provider (c2p), 82.8% peer to peer (p2p), and 90.3% sibling to sibling (s2s) relationships. We then cross-compare the reported AS connectivity with the AS connectivity data contained in BGP tables. We regret to report that BGP tables miss up to 86.2% of the true adjacencies of the surveyed ASs. The majority of the missing links are of the p2p type, meaning that, in reality, peering links are likely to be more dominant than have been previously reported or conjectured. Finally, to make our results easily accessible and practically useful for the community, we open an AS relationship repository where we archive, on a weekly basis, and make publicly available the complete Internet AS-level topologies enriched with AS relationship information for every pair of AS neighbors.

Keywords: policy, routing, topology
  Last Modified: Wed May-3-2017 10:57:25 PDT
  Page URL: http://www.caida.org/publications/papers/2007/as_relationships_inference/index.xml