Shortest paths and loop-free routing in dynamic networks

This publication has 11 references indexed in Scilit:

• A new responsive distributed shortest-path rounting algorithm
  Published by Association for Computing Machinery (ACM) ,1989
• A loop-free extended Bellman-Ford routing protocol without bouncing effect
  Published by Association for Computing Machinery (ACM) ,1989
• A unified approach to loop-free routing using distance vectors or link states
  Published by Association for Computing Machinery (ACM) ,1989
• A minimum-hop routing algorithm based on distributed information
  Computer Networks and ISDN Systems, 1989
• A new distributed algorithm to find breadth first search trees
  IEEE Transactions on Information Theory, 1987
• Complexity of network synchronization
  Journal of the ACM, 1985
• Termination detection for diffusing computations
  Information Processing Letters, 1980
• The New Routing Algorithm for the ARPANET
  IEEE Transactions on Communications, 1980
• A Failsafe Distributed Routing Protocol
  IEEE Transactions on Communications, 1979
• A correctness proof of a topology information maintenance protocol for a distributed computer network
  Communications of the ACM, 1977