Algorithm 562: Shortest Path Lengths [H]
ACM Transactions on Mathematical Software (TOMS)
Communications of the ACM
| Hi-index | 0.00 |
Several algorithms have proven to be useful in computing the shortest path between two nodes in a network. Their complexity depends on the problem definition and size of the network measured by the total number of nodes N. In these algorithms, finding all the shortest paths from a fixed node is a computation of complexity O(N x N). These algorithms have been used successfully in long-haul networks for many years. Recent growth of such networks to large numbers of nodes (e.g., N 500) demands a more efficient approach. This paper develops three heuristics based on measured topological characteristics of computer communication networks and applies them in the construction of faster algorithms. Determination of the shortest path between two random nodes is then shown to require 50 to 60% less computation.