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.