Advances in Verifiable Fail-Safe Routing Procedures
- 1 April 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 29 (4) , 491-497
- https://doi.org/10.1109/tcom.1981.1095017
Abstract
Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented. The protocols here possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure, as well as the communication and storage needs. In addition, we present a procedure for establishing new and disrupted calls in a virtual or physical circuit-switched network, and for canceling existing calls, such that each call is loop-free and is established according to the routing tables provided by the protocol.Keywords
This publication has 6 references indexed in Scilit:
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- A Failsafe Distributed Protocol for Minimum Delay RoutingIEEE Transactions on Communications, 1981
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979
- Optimal Distributed Routing for Virtual Line-Switched Data NetworksIEEE Transactions on Communications, 1979
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977