On Mon, Nov 12, 2018 at 8:18 AM Juliusz Chroboczek wrote:
>
> >> do loop-free routing.
>
> > Hah. :)
>
> > I note that babel doesn't actually do that, any more.
>
> Pick a pair (p, id), where p is a prefix and id is a router id. Consider
> the graph defined by all route table entries indexed by
>> do loop-free routing.
> Hah. :)
> I note that babel doesn't actually do that, any more.
Pick a pair (p, id), where p is a prefix and id is a router id. Consider
the graph defined by all route table entries indexed by (p, id). Then
Babel guarantees that at any time this graph is acyclic.
