### Abstract

A new distributed algorithm is presented which finds the shortest paths from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH toplogy is introduced and characterized in this paper, and it is shown that most large interconnected data networks belong to this class. Assuming one processor is available per node in an n node BH topology, the computation and communication time complexities of the proposed algorithm are O(logn) and O[(logn) ^{2}], respectively. (Actually, a communication complexity of O(log n) can be achieved, but due to the space limit the description of this more sophisticated communication scheme is not included in this paper.) 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 |
---|---|

Title of host publication | IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies |

Pages | 183-192 |

Number of pages | 10 |

DOIs | |

Publication status | Published - 1 Dec 1989 |

Externally published | Yes |

Event | 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 - Ottawa, ON, Canada Duration: 23 Apr 1989 → 27 Apr 1989 |

### Other

Other | 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 |
---|---|

Country | Canada |

City | Ottawa, ON |

Period | 23/4/89 → 27/4/89 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies*(pp. 183-192). [101451] https://doi.org/10.1109/INFCOM.1989.101451

**A fast distributed shortest path algorithm for a class of hierarchically structured data networks.** / Antonio, John K.; Huang, Garng Morton; Tsai, Wei K.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies.*, 101451, pp. 183-192, 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89, Ottawa, ON, Canada, 23/4/89. https://doi.org/10.1109/INFCOM.1989.101451

}

TY - GEN

T1 - A fast distributed shortest path algorithm for a class of hierarchically structured data networks

AU - Antonio, John K.

AU - Huang, Garng Morton

AU - Tsai, Wei K.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - A new distributed algorithm is presented which finds the shortest paths from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH toplogy is introduced and characterized in this paper, and it is shown that most large interconnected data networks belong to this class. Assuming one processor is available per node in an n node BH topology, the computation and communication time complexities of the proposed algorithm are O(logn) and O[(logn) 2], respectively. (Actually, a communication complexity of O(log n) can be achieved, but due to the space limit the description of this more sophisticated communication scheme is not included in this paper.) 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 which finds the shortest paths from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH toplogy is introduced and characterized in this paper, and it is shown that most large interconnected data networks belong to this class. Assuming one processor is available per node in an n node BH topology, the computation and communication time complexities of the proposed algorithm are O(logn) and O[(logn) 2], respectively. (Actually, a communication complexity of O(log n) can be achieved, but due to the space limit the description of this more sophisticated communication scheme is not included in this paper.) 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.

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

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

U2 - 10.1109/INFCOM.1989.101451

DO - 10.1109/INFCOM.1989.101451

M3 - Conference contribution

AN - SCOPUS:0024646924

SN - 0818619201

SN - 9780818619205

SP - 183

EP - 192

BT - IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies

ER -