Skip to Main Content
ASME Press Select Proceedings

International Conference on Advanced Computer Theory and Engineering, 5th (ICACTE 2012)

Editor
Xie Yi
Xie Yi
Search for other works by this author on:
ISBN:
9780791860045
No. of Pages:
938
Publisher:
ASME Press
Publication date:
2012

The no-valley and prefer-customer policies are two important routing policies to guarantee the safety and robustness of the inter-domain routing system. Given an AS (Autonomous System) topology, shortest path calculation in topology analysis must consider the two routing policies simultaneously. In this paper, we propose a valley-free shortest path algorithm using the classic Dijkstra’s algorithm framework. The algorithm finds shortest policy paths from other nodes to a specified destination in order to accomodate the routing policies. Using real topology data sets from CAIDA, we compare the proposed algorithm with the Dijkstra’s algorithm. It turns out that although the routing policies give rise to the complexity in calculating, the time complexity of the algorithm is approximate to that of the classic algorithm. Additionally, we found that the differences of shortest path lengths with/without the policy constraints in the topology snapshots are decreasing with the evolution of the Internet.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal