### 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 - 1 Jan 1992 |

Externally published | Yes |

### 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

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

### Cite this

*IEEE Transactions on Computers*,

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

**A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks.** / Antonio, John K.; Huang, Garng Morton; Tsai, Wei K.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. 41, no. 6, pp. 710-724. https://doi.org/10.1109/12.144623

}

TY - JOUR

T1 - A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks

AU - Antonio, John K.

AU - Huang, Garng Morton

AU - Tsai, Wei K.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

KW - Asynchronous computation

KW - data networks

KW - distributed computation

KW - dynamic programming

KW - hierarchical network topologies

KW - hierarchical routing algorithms

KW - optimal routing

KW - parallel computation

KW - shortest path algorithms

KW - time complexity

UR - http://www.scopus.com/inward/record.url?scp=0026880674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026880674&partnerID=8YFLogxK

U2 - 10.1109/12.144623

DO - 10.1109/12.144623

M3 - Article

AN - SCOPUS:0026880674

VL - 41

SP - 710

EP - 724

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 6

ER -