Computing the types of the relationships between autonomous systems

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 relati onships 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 hard ness of the general problem, we propose approximation algorithms a nd heuristics based on a novel paradigm and show their effectiv eness against publicly available data sets. The experiments prov ide evidence that our algorithms perform significantly better than state-of-the-art heuristics.

[1]  Lixin Gao,et al.  Hierarchical structure of the logical Internet graph , 2001, SPIE ITCom.

[2]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[3]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[5]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[6]  Walter Didimo,et al.  Visualization of the High Level Structure of the Internet with HERMES , 2002, J. Graph Algorithms Appl..

[7]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  G. Huston,et al.  Interconnection, Peering and Settlements , 2003 .

[9]  Thomas Erlebach,et al.  Classifying customer-provider relationships in the internet , 2002 .

[10]  Michalis Faloutsos,et al.  Analyzing BGP policies: methodology and tool , 2004, IEEE INFOCOM 2004.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[13]  John W. Stewart,et al.  BGP4 : inter-domain routing in the Internet , 1998 .

[14]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[15]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

[16]  Jennifer Rexford,et al.  Inherently safe backup routing with BGP , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[19]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[20]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[21]  Kurt Rothermel,et al.  Dynamic distance maps of the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.