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

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

[1]  Clyde P. Kruskal,et al.  Parallel Algorithms for Shortest Path Problems , 1985, ICPP.

[2]  Robert M. Hinden,et al.  The DARPA Internet: Interconnecting Heterogeneous Computer Networks with Gateways , 1983, Computer.

[3]  Jeffrey D. Ullman,et al.  The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[5]  Norman F. Schneidewind.  Interconnecting Local Networks to Long-Distance Networks , 1983, Computer.

[6]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[7]  Dimitri Bertsekas,et al.  Distributed dynamic programming , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[8]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[9]  John K. Antonio,et al.  Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks , 1989 .

[10]  C. V. Ramamoorthy,et al.  An Adaptive Hierarchical Routing Protocol , 1989, IEEE Trans. Computers.

[11]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[12]  John K. Antonio,et al.  Fast Parallel Hierarchical Aggregation/Disaggregation Algorithms for Multistage Optimization Problems and Shortest Path Problems , 1989 .

[13]  John K. Antonio,et al.  Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks , 1988, 1988 American Control Conference.

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Wei-Tek Tsai.  Control and management of large and dynamic networks , 1986 .

[16]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[17]  William D. Tajibnapis,et al.  A correctness proof of a topology information maintenance protocol for a distributed computer network , 1977, CACM.

[18]  Eric Benhamou,et al.  Multilevel Internetworking Gateways: Architecture and Applications , 1983, Computer.

[19]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.