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

Author

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

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

fYear

1989

fDate

23-27 Apr 1989

Firstpage

183

Abstract

A distributed algorithm is presented which finds the shortest path 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 topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. 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

Keywords

computational complexity; data structures; distributed processing; computational complexity; fast distributed shortest path algorithm; generalized balanced-tree hierarchy; hierarchically structured data networks; network topology; ARPANET; Algorithm design and analysis; Bones; Complexity theory; Computer networks; Distributed algorithms; Distributed computing; Network topology; Shortest path problem; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE

Conference_Location

Ottawa, Ont.

Print_ISBN

0-8186-1920-1

Type

conf

DOI

10.1109/INFCOM.1989.101451

Filename

101451