Minimal order loop-free routing strategy
- 1 July 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (7), 870-881
- https://doi.org/10.1109/12.55689
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the number of acceptable task assignments in distributed computing systemsIEEE Transactions on Computers, 1990
- Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type LoopingIEEE Transactions on Computers, 1987
- Updating routing tables after resource failure in a distributed computer networkNetworks, 1984
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Routing Techniques Used in Computer Communication NetworksIEEE Transactions on Communications, 1980
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- The ARPA network design decisionsComputer Networks (1976), 1977
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- A Routing Procedure for the TIDAS Message-Switching NetworkIEEE Transactions on Communications, 1975