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

John K. Antonio, Garng M. Huang, Wei K. Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationIEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages183-192
Number of pages10
DOIs
Publication statusPublished - 1 Dec 1989
Event8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 - Ottawa, ON, Canada
Duration: 23 Apr 198927 Apr 1989

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

Other8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89
CountryCanada
CityOttawa, ON
Period23/4/8927/4/89

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A fast distributed shortest path algorithm for a class of hierarchically structured data networks'. Together they form a unique fingerprint.

  • Cite this

    Antonio, J. K., Huang, G. M., & Tsai, W. K. (1989). A fast distributed shortest path algorithm for a class of hierarchically structured data networks. In IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 183-192). [101451] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.1989.101451