Inferring AS Relationships: Dead End or Lively Beginning?

Simple item page
dc.creatorDimitropoulos, Xenofontas
dc.creatorKrioukov, Dmitri
dc.creatorHuffaker, Bradley
dc.creatorclaffy, kc
dc.creatorRiley, George
dc.date2005-07-19
dc.date.accessioned2026-07-25T16:54:33Z
dc.descriptionRecent 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.
dc.identifierhttps://arxiv.org/abs/cs/0507047
dc.identifierhttp://arxiv.org/abs/cs/0507047
dc.identifierWEA 2005; LNCS 3503, p. 113, 2005
dc.identifierdoi:10.1007/11427186_12
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/44066
dc.subjectNetworking and Internet Architecture
dc.subjectData Structures and Algorithms
dc.titleInferring AS Relationships: Dead End or Lively Beginning?
dc.typetext

Files

Collections

arXiv