An efficient algorithm for AS path inferring

Discovering the AS paths between two ASes is invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require direct access to the source node. Recently, with more accurate AS relationship inferring algorithm and publicly available AS topology data, it is possible to infer AS paths without accessing the source. This paper proposes an efficient algorithm for inferring all pair shortest AS paths in a relationship annotated AS graph. The running time of the algorithm is O(NM), where N is the number of nodes and M is the number of edges in AS graph. The algorithm bases on the bread-first-search (BFS) algorithm, and experimental results show that it reduces running time dramatically compared with the existing algorithm whose running time is O(N3).

[1]  Thomas Erlebach,et al.  Computing the types of the relationships between autonomous systems , 2007, IEEE/ACM Trans. Netw..

[2]  Lixin Gao,et al.  On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

[4]  Xenofontas A. Dimitropoulos,et al.  Modeling Autonomous-System Relationships , 2006, 20th Workshop on Principles of Advanced and Distributed Simulation (PADS'06).

[5]  Lixin Gao,et al.  CAM04-4: AS Path Inference by Exploiting Known AS Paths , 2006, IEEE Globecom 2006.

[6]  Rami Cohen,et al.  Acyclic Type of Relationships Between Autonomous Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Dmitri V. Krioukov,et al.  Inferring AS Relationships: Dead End or Lively Beginning? , 2005, WEA.

[8]  Giuseppe 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).

[9]  Yin Zhang,et al.  On AS-level path inference , 2005, SIGMETRICS '05.

[10]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[11]  Author.  $article.title , 2002, Nature.

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

[13]  Sven Kosub,et al.  Acyclic Type-of-Relationship Problems on the Internet , 2006, CAAN.

[14]  Walter Willinger,et al.  Inferring AS-level Internet topology from router-level path traces , 2001, SPIE ITCom.

[15]  Jia Wang,et al.  Towards an accurate AS-level traceroute tool , 2003, SIGCOMM '03.

[16]  G. Clark,et al.  Reference , 2008 .