Subtle design issues in the implementation of distributed, dynamic routing algorithms
- 31 December 1986
- journal article
- Published by Elsevier in Computer Networks and ISDN Systems
- Vol. 12 (3) , 147-158
- https://doi.org/10.1016/0169-7552(86)90053-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Distributed Multi-Destination Routing: The Constraints of Local InformationSIAM Journal on Computing, 1985
- Automatic Update of Replicated Topology DatabasesIEEE Transactions on Communications, 1985
- Algorithms for finding paths with multiple constraintsNetworks, 1984
- A Reliable Broadcast ProtocolIEEE Transactions on Communications, 1983
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- Advances in Verifiable Fail-Safe Routing ProceduresIEEE Transactions on Communications, 1981
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977