A fast distributed shortest path algorithm for a class of hierarchically clustered data networks
- 1 June 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (6) , 710-724
- https://doi.org/10.1109/12.144623
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networksIEEE Transactions on Automatic Control, 1989
- An adaptive hierarchical routing protocolIEEE Transactions on Computers, 1989
- Distributed asynchronous computation of fixed pointsMathematical Programming, 1983
- The DARPA Internet: Interconnecting Heterogeneous Computer Networks with GatewaysComputer, 1983
- Interconnecting Local Networks to Long-Distance NetworksComputer, 1983
- Distributed dynamic programmingIEEE Transactions on Automatic Control, 1982
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981
- Routing Techniques Used in Computer Communication NetworksIEEE Transactions on Communications, 1980
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959