Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Collecting the internet AS-level topology
ACM SIGCOMM Computer Communication Review
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
In search for an appropriate granularity to model routing policies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
In search of the elusive ground truth: the internet's as-level connectivity structure
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users
Proceedings of the 5th international conference on Emerging networking experiments and technologies
The flattening internet topology: natural evolution, unsightly barnacles or contrived collapse?
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
Proceedings of the ACM SIGCOMM 2010 conference
The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh
Proceedings of the 6th International COnference
BGP and inter-AS economic relationships
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Let the market drive deployment: a strategy for transitioning to BGP security
Proceedings of the ACM SIGCOMM 2011 conference
Twelve years in the evolution of the internet ecosystem
IEEE/ACM Transactions on Networking (TON)
Anatomy of a large european IXP
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Mapping the expansion of Google's serving infrastructure
Proceedings of the 2013 conference on Internet measurement conference
Inferring multilateral peering
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
A first look at IPv4 transfer markets
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
Business relationships between ASes in the Internet are typically confidential, yet knowledge of them is essential to understand many aspects of Internet structure, performance, dynamics, and evolution. We present a new algorithm to infer these relationships using BGP paths. Unlike previous approaches, our algorithm does not assume the presence (or seek to maximize the number) of valley-free paths, instead relying on three assumptions about the Internet's inter-domain structure: (1) an AS enters into a provider relationship to become globally reachable; and (2) there exists a peering clique of ASes at the top of the hierarchy, and (3) there is no cycle of p2c links. We assemble the largest source of validation data for AS-relationship inferences to date, validating 34.6% of our 126,082 c2p and p2p inferences to be 99.6% and 98.7% accurate, respectively. Using these inferred relationships, we evaluate three algorithms for inferring each AS's customer cone, defined as the set of ASes an AS can reach using customer links. We demonstrate the utility of our algorithms for studying the rise and fall of large transit providers over the last fifteen years, including recent claims about the flattening of the AS-level topology and the decreasing influence of tier-1 ASes on the global Internet.