[Babel-users] Questions

[Juliusz Chroboczek]

> A -- B -- C

> When B runs its "run" then it learns the shortest path towards C. And
> when A runs its "run" and the shortest path between B and C is already
> found/calculated and it is not recalculated again (what would be if
> you would say that runs are independent). No?

The algorithm is run once for each *source* of routing data (destination
of data packets).  For example, there's one instance of the algorithm
that computes all routes to source C.

As you rightly note, the computation of A's shortest route to source
C is based on B's computation of its shortest path to the same source.
However, the computation of routes to C is completely independent of the
computation of the routes to a different source D.

-- Juliusz