What is an intuitive way to think about the convergence of the distance vector routing algorithm?

According to Wikipedia:

Distance-vector routing protocols use the Bellman–Ford algorithm and Ford–Fulkerson algorithm to calculate the best route.

I am aware of the Bellman-Ford and Ford-Fulkerson algorithms and have some intuition for how and why they work. Unfortunately, I fail to see how they relate to the asynchronous distributed distance vector algorithm and so I lack intuition about why it converges.

  • $\begingroup$ Can you see how a distance-vector routing protocols can use the Bellman–Ford algorithm? $\endgroup$
    – John L.
    May 18 '19 at 16:14
  • $\begingroup$ I guess that the Bellman-Ford algorithm could be used in a centralized manner and compute the shortest paths from a router to all other for each router in the network. $\endgroup$
    – giannisl9
    May 18 '19 at 17:07
  • $\begingroup$ @Apass.Jack is there a way to improve the question so it gets more active and I get some insight? $\endgroup$
    – giannisl9
    May 20 '19 at 22:21
  • $\begingroup$ Have you tried proving that the (basic version of) distance-vector routing protocol works for a connected network with a static topology and weights? $\endgroup$
    – John L.
    May 21 '19 at 3:49
  • $\begingroup$ @Apass.Jack, no, I have not tried to prove the correctness of the algorithm. A formal proof would be useful, but I am more interested in the intuition behind it. Providing a formal proof and commenting on it will suffice. $\endgroup$
    – giannisl9
    May 23 '19 at 10:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.