Logical Map and Ranked Routes

This operation determines the best routes from an origin site to a set of destination sites based on user selectable ranking criteria.

Click Operations -> Logical Map / Ranked Route to start the process.

Set the Link group to be used as the scope of the operation: This is the main constraint on the size of the calculation.
Click Select Origin Site: The button will toggle to red while in this mode. Click on a site to select the source site to generate the routes from this site to all reachable destinations. This site must be at one end of a link in the link group. The calculation will complete once the source is selected.
Select a Ranking Criteria: Click on the criteria drop-down list to change the ranking criteria. The different criteria are described below. The routes will automatically.
Optional Set Destination Site Group: Restrict the report to a group or selection of Destination sites.
Select a Destination Site: You can view a route to a specific destination by clicking Select Destination. The button will toggle red while in this mode, click the button again to exit. The route will be shown on screen and you can also save this route to a group.
CSV Report: Export the best ranked routes to each destination in a csv report ordered by score.

Number of Hops: Generates a basic site connectivity tree relative to the origin site. No Link file is required. Routes with the same number of links are considered equal. Uses Breadth-First Search algorithm
Shortest Path Length: Finds the routes with the shortest total path length from the origin to all other sites. No link file required. Uses Dijkstra's algorithm.
Minimize Unavailability: Find the routes that have the minimum total unavailability. Links must have a link file with completed calculation to be used on the route. ACM links use the unavailability of the reference modulation state. Uses Dijkstra's algorithm.
Minimize Capacity Bottleneck: This will find the route that maximizes the capacity of the route. Links must have a file with a complete ACM calculation including Average Capacity. Links with lower capacities will be avoided if possible. Shorter routes will be preferred when the capacities between routes are similar (within 5%). Uses weighted Maximin Algorithm.