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

John K. Antonio, Garng Morton 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
Externally publishedYes
Event8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 - Ottawa, ON, Canada
Duration: 23 Apr 198927 Apr 1989

Other

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

Fingerprint

Communication
Topology
Parallel algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

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

IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies. 1989. p. 183-192 101451.

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

Antonio, JK, Huang, GM & Tsai, WK 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., 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
Antonio JK, Huang GM, Tsai WK. 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. 1989. p. 183-192. 101451 https://doi.org/10.1109/INFCOM.1989.101451
Antonio, John K. ; Huang, Garng Morton ; Tsai, Wei K. / A fast distributed shortest path algorithm for a class of hierarchically structured data networks. IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies. 1989. pp. 183-192
@inproceedings{b4a6bf55c51945808f41a66b094202e7,
title = "A fast distributed shortest path algorithm for a class of hierarchically structured data networks",
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.",
author = "Antonio, {John K.} and Huang, {Garng Morton} and Tsai, {Wei K.}",
year = "1989",
month = "12",
day = "1",
doi = "10.1109/INFCOM.1989.101451",
language = "English",
isbn = "0818619201",
pages = "183--192",
booktitle = "IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies",

}

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 -