### Abstract

A new 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. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.

Original language | English |
---|---|

Pages (from-to) | 710-724 |

Number of pages | 15 |

Journal | IEEE Transactions on Computers |

Volume | 41 |

Issue number | 6 |

DOIs | |

Publication status | Published - Jun 1992 |

### Fingerprint

### Keywords

- Asynchronous computation
- data networks
- distributed computation
- dynamic programming
- hierarchical network topologies
- hierarchical routing algorithms
- optimal routing
- parallel computation
- shortest path algorithms
- time complexity

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics

### Cite this

*IEEE Transactions on Computers*,

*41*(6), 710-724. https://doi.org/10.1109/12.144623