Lines Matching full:shortest
895 (SL) to provide deadlock-free shortest-path routing while also
914 single-source-shortest-path routing, which uses the SSSP algorithm
918 9. SSSP unicast routing algorithm - a single-source-shortest-path routing
1161 LASH is an acronym for LAyered SHortest Path Routing. It is a
1162 deterministic shortest path routing algorithm that enables topology
1166 topology for the shortest-path routes between all pairs of sources /
1176 1) LASH determines the shortest-path between all pairs of source /
1204 related to a root node and always routes shortest-path.
1233 algorithm and so uses shortest paths. Instead of spreading traffic
1234 out across different paths with the same shortest distance, it chooses
1235 among the available shortest paths based on an ordering of dimensions.
1256 The (Deadlock-Free) Single-Source-Shortest-Path routing algorithm is
1272 2.1) use Dijkstra's algorithm to find the shortest path from all
1405 "Layered Shortest Path (LASH) Routing in Irregular System Area