Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
Modeling Autonomous-System Relationships
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Efficient large-scale BGP simulations
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Acyclic type-of-relationship problems on the internet: an experimental analysis
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
ACM SIGCOMM Computer Communication Review
Policy relationship annotations of predefined AS-level topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Inter-Domain Access Volume Model: Ranking Autonomous Systems
Information Networking. Towards Ubiquitous Networking and Services
Graph annotations in modeling complex network topologies
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An efficient algorithm for AS path inferring
Proceedings of the 2009 International Conference on Hybrid Information Technology
A hierarchy and probability-based approach for inferring AS relationships
AINTEC '09 Asian Internet Engineering Conference
Near-deterministic inference of AS relationships
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Estimating AS relationships for application-layer traffic optimization
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
BGP and inter-AS economic relationships
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
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 |
Recent techniques for inferring business relationships between ASs [1,2] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao[3]. However, some relationships inferred by these newer algorithms are incorrect, leading to the deduction of unrealistic AS hierarchies. We investigate this problem and discover what causes it. Having obtained such insight, we generalize the problem of AS relationship inference as a multiobjective optimization problem with node-degree-based corrections to the original objective function of minimizing the number of invalid paths. We solve the generalized version of the problem using the semidefinite programming relaxation of the MAX2SAT problem. Keeping the number of invalid paths small, we obtain a more veracious solution than that yielded by recent heuristics.