An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Bgp
Introduction to Algorithms
How to extract BGP peering information from the internet routing registry
Proceedings of the 2006 SIGCOMM workshop on Mining network data
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)
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The (in)completeness of the observed internet AS-level structure
IEEE/ACM Transactions on Networking (TON)
Obtaining provably legitimate internet topologies
IEEE/ACM Transactions on Networking (TON)
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 |
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is provided. We investigate the maximum acyclic type-of-relationship problem: on a given set of AS paths, find a maximum-cardinality subset which allows an acyclic and valley-free orientation. Inapproximability and NP-hardness results for this problem are presented and a heuristic is designed. The heuristic is experimentally compared to most of the state-of-the-art algorithms on a reliable data set. It turns out that the proposed heuristic produces the least number of misclassified customer-to-provider relationships among the tested algorithms. Moreover, it is flexible in handling pre-knowledge in the sense that already a small amount of correct relationships is enough to produce a high-quality relationship classification. Furthermore, the reliable data set is used to validate the acyclicity assumptions. The findings demonstrate that acyclicity notions should be an integral part of models of AS relationships.