Stepwise Assertional Design of Distance–Vector Routing Algorithms

This publication has 10 references indexed in Scilit:

• A relational notation for state transition systems
  IEEE Transactions on Software Engineering, 1990
• A loop-free extended Bellman-Ford routing protocol without bouncing effect
  Published by Association for Computing Machinery (ACM) ,1989
• A new responsive distributed shortest-path rounting algorithm
  ACM SIGCOMM Computer Communication Review, 1989
• A unified approach to loop-free routing using distance vectors or link states
  ACM SIGCOMM Computer Communication Review, 1989
• Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
  IEEE Transactions on Computers, 1987
• A Responsive Distributed Routing Algorithm for Computer Networks
  IEEE Transactions on Communications, 1982
• Termination detection for diffusing computations
  Information Processing Letters, 1980
• A Failsafe Distributed Routing Protocol
  IEEE Transactions on Communications, 1979
• A Review of the Development and Performance of the ARPANET Routing Algorithm
  IEEE Transactions on Communications, 1978
• An axiomatic proof technique for parallel programs I
  Acta Informatica, 1976