Computing the Types of the Relationships Between Autonomous Systems

Author

Di Battista, Giuseppe ; Erlebach, Thomas ; Hall, Alexander ; Patrignani, Maurizio ; Pizzonia, Maurizio ; Schank, Thomas

Author_Institution

Dipt. di Informatica e Automazione, Univ. di Roma, Rome

Volume

15

Issue

2

fYear

2007

fDate

4/1/2007 12:00:00 AM

Firstpage

267

Lastpage

280

Abstract

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 (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

Keywords

Internet; computational complexity; optimisation; routing protocols; BGP routing tables; Internet autonomous systems; NP-completeness result; approximation algorithms; Abstracts; Approximation algorithms; Communications Society; Computer networks; Computer science; Heuristic algorithms; Information systems; Internet; Routing protocols; Telecommunication traffic; Algorithms; Internet; routing;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/TNET.2007.892878

Filename

4154752