Traceroute + Redundancy Verification

With the same algorithm used in the OSPF and IS-IS routing protocols, it is possible to calculate the shortest path a packet will traverse across the area.

Each circuit is labeled "Cost - Network - Cost". The cost closest to the router is the router's configured cost for that network. Dijkstra's algorithm is then used to determine the shortest (lowest cost) path to travel.

Disabled Enabled Shortest Path 4 - 172.16.0.0/30 - 4 8 - 172.16.0.4/30 - 8 10 - 172.16.0.8/30 - 10 11 - 172.16.0.12/30 - 11 7 - 172.16.0.16/30 - 7 4 - 172.16.0.20/30 - 4 2 - 172.16.0.24/30 - 2 9 - 172.16.0.28/30 - 9 14 - 172.16.0.32/30 - 14 10 - 172.16.0.36/30 - 10 2 - 172.16.0.40/30 - 2 1 - 172.16.0.44/30 - 1 6 - 172.16.0.48/30 - 6 7 - 172.16.0.52/30 - 7 R1 R2 R3 R4 R5 R6 R7 R8 R9
Enable - Disable Network