On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Collecting the internet AS-level topology
ACM SIGCOMM Computer Communication Review
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Internet routing resilience to failures: analysis and implications
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Uncovering performance differences among backbone ISPs with Netdiff
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Ten years in the evolution of the internet ecosystem
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
On cooperative settlement between content, transit and eyeball internet service providers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
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 (in)completeness of the observed internet AS-level structure
IEEE/ACM Transactions on Networking (TON)
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
Improving the reliability of inter-AS economic inferences through a hygiene phase on BGP data
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Internet routing depends on economic relationships between ASes (Autonomous Systems). Despite extensive prior research of these relationships, their characterization remains imprecise. In this paper, we focus on provider-free ASes that reach the entire Internet without paying anyone for the traffic delivery. While the ground truth about PFS (set of the provider-free ASes) lies outside the public domain, we use trustworthy non-verifiable sources as a baseline for result validation. Straightforward extraction of PFS from public datasets of inter-AS economic relationships yields poor results. Then, we develop a more sophisticated Temporal Cone (TC) algorithm that relies on topological statistics (customer cones of ASes) and exploits the temporal diversity of the datasets. Our evaluation shows that the TC algorithm infers PFS from the same public datasets with a significantly higher accuracy. We also assess the sensitivity of the TC algorithm to its parameters.