Randomized algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Some optimal inapproximability results
Journal of the ACM (JACM)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
An Analysis of Internet Inter-Domain Topology and Route Stability
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
In search for an appropriate granularity to model routing policies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Acyclic type-of-relationship problems on the internet: an experimental analysis
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Algorithm 875: DSDP5—software for semidefinite programming
ACM Transactions on Mathematical Software (TOMS)
ACM SIGCOMM Computer Communication Review
Policy relationship annotations of predefined AS-level topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Basic properties of the IPv6 AS-level topology
ACM SIGMETRICS Performance Evaluation Review
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
On cooperative settlement between content, transit and eyeball internet service providers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
An efficient algorithm for AS path inferring
Proceedings of the 2009 International Conference on Hybrid Information Technology
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A hierarchy and probability-based approach for inferring AS relationships
AINTEC '09 Asian Internet Engineering Conference
Incentive-compatible interdomain routing with linear utilities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Congestion avoiding mechanism based on inter-domain hierarchy
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Estimating AS relationships for application-layer traffic optimization
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
On cooperative settlement between content, transit, and eyeball internet service providers
IEEE/ACM Transactions on Networking (TON)
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
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
Network discovery and verification with distance queries
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
Approximate discovery of random graphs
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
AS relationships, customer cones, and validation
Proceedings of the 2013 conference on Internet measurement conference
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 |
We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced by Gao [IEEE/ACM TRANSACTIONS ON NETWORKING, 9(6):733-645, 2001] and Subramanian et al. (IEEE Infocom, 2002) that bases the discovery of such relationships on the analysis of the AS paths extracted from the BGP routing tables. We characterize the time complexity of the above problem, showing both NP-completeness results and efficient algorithms for solving specific cases. Motivated by the hardness of the general problem, we propose approximation algorithms and heuristics based on a novel paradigm and show their effectiveness against publicly available data sets. The experiments provide evidence that our algorithms perform significantly better than state-of-the-art heuristics.