Issue No. 06 - June (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.144623
<p>A distributed algorithm is presented that can be used to solve the single-destination shortest path (SDSP) problem or the all-pairs shortest path (APSP) problem for a class of clustered data networks. The network graph is assumed to be characterized with a balanced hierarchically clustered (BHC) topology. The BHC topology is introduced in this paper and is shown to be a realistic characterization for a large class of interconnected data networks. For certain types of BHC topologies, the SDSP problem can be solved with computation and communication time complexities of O(log n), assuming one processor is available at each of the n number of nodes. Assuming p processors are available at each node, computation and communication time complexities of O((n/p) log n) and O(n log n) are achievable, respectively, for solving the APSP problem. It is also shown that the algorithm converges in an asynchronous environment.</p>
shortest path algorithm; hierarchically clustered data networks; single-destination shortest path; all-pairs shortest path; computational complexity; graph theory; parallel algorithms.
G. Huang, J. Antonio and W. Tsai, "A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks," in IEEE Transactions on Computers, vol. 41, no. , pp. 710-724, 1992.