On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Towards an accurate AS-level traceroute tool
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling Autonomous-System Relationships
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Who profits from peer-to-peer file-sharing?: traffic optimization potential in BitTorrent swarms
Proceedings of the 24th International Teletraffic Congress
Hi-index | 0.00 |
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).