Earticle

초록

영어

Discovering the AS paths between two ASes are 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).

목차

Abstract
 1. Introduction
 2. Related Work
 3. AS Path Inference Algorithm
  3.1 AS Relationships and AS Path
  3.2 Traversal Stage
  3.3 Traceback Stage
 4. Simulation and Validation
 Reference

키워드

저자

• Yang Guoqiang [ National Univernity of Defence Technololy, China ]
• Dou Wenhua [ National Univernity of Defence Technololy, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605