A loop-free extended Bellman-Ford routing protocol without bouncing effect

This publication has 11 references indexed in Scilit:

• 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 protocol to maintain a minimum spanning tree in a dynamic topology
  Published by Association for Computing Machinery (ACM) ,1988
• Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
  IEEE Transactions on Computers, 1987
• Reliable broadcast protocols in unreliable networks
  Networks, 1986
• A routing algorithm for interconnected local area networks
  Computer Networks and ISDN Systems, 1985
• An algorithm for distributed computation of a spanningtree in an extended LAN
  Published by Association for Computing Machinery (ACM) ,1985
• Fail-stop processors
  ACM Transactions on Computer Systems, 1983
• The ARPA network design decisions
  Computer Networks (1976), 1977
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959