Paper Info
Title
Inferring Complex AS Relationships
Abstract
The traditional approach of modeling relationships between ASes abstracts relationship types into three broad categories: transit, peering, and sibling. More complicated configurations exist, and understanding them may advance our knowledge of Internet economics and improve models of routing. We use BGP, traceroute, and geolocation data to extend CAIDA's AS relationship inference algorithm to infer two types of complex relationships: hybrid relationships, where two ASes have different relationships at different interconnection points, and partial transit relationships, which restrict the scope of a customer relationship to the provider's peers and customers. Using this new algorithm, we find 4.5% of the 90,272 provider-customer relationships observed in March 2014 were complex, including 1,071 hybrid relationships and 2,955 partial-transit relationships. Because most peering relationships are invisible, we believe these numbers are lower bounds. We used feedback from operators, and relationships encoded in BGP communities and RPSL, to validate 20% and 6.9% of our partial transit and hybrid inferences, respectively, and found our inferences have 92.9% and 97.0% positive predictive values. Hybrid relationships are not only established betweenlarge transit providers; in 57% of the inferred hybrid transit/peering relationships the customer had a customer cone of fewer than 5 ASes.
Year
DOI
Venue
2014
10.1145/2663716.2663743
Internet Measurement Conference
Keywords
Field
DocType
as relationships,complex routing policies,internet,network topology
Customer relationship management,Data mining,Inference,Computer science,traceroute,Geolocation,Computer network,Operator (computer programming),Artificial intelligence,Peering,restrict,The Internet
Conference
Citations 
PageRank 
References 
28
1.15
17
Authors
4
Name
Order
Citations
PageRank
Vasileios Giotsas117216.87
Matthew J. Luckie21117.66
Bradley Huffaker364654.28
Kc Claffy41905115.64