Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis > publications : papers : 2005 : asrelationships
Inferring AS Relationships: Dead End or Lively Beginning?
X. Dimitropoulos, D. Krioukov, B. Huffaker, k. claffy, and G. Riley, "Inferring AS Relationships: Dead End or Lively Beginning?", in Workshop on Efficient and Experimental Algorithms (WEA), May 2005, pp. 113--125.
|   View full paper:    PDF    DOI    |  Citation:    BibTeX    Resource Catalog   |

Inferring AS Relationships: Dead End or Lively Beginning?

Xenofontas Dimitropoulos1, 3
Dmitri Krioukov1
Bradley Huffaker1
kc claffy1
George Riley2

CAIDA, San Diego Supercomputer Center, University of California San Diego


Georgia Institute of Technology (Georgia Tech)


School of Electrical and Computer Engineering, Georgia Institute of Technology

Abstract. Recent techniques for inferring business relationships between ASs have yielded maps that have extremely few invalid BGP paths in the terminology of Gao. 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.

Keywords: routing, topology
  Last Modified: Tue Nov-17-2020 04:46:59 UTC
  Page URL: