babeld
babeld copied to clipboard
improve route updates from kernel
Taken from the Mailing List from a mail from @jech
The redistribution code in babeld is very primitive:
- the code makes a full route dump whenever something changes and computes the difference, rather than receiving incremental deltas from the kernel;
- it uses a quadratic algorithm to compute the difference.
Point 2 has been adressed -- we now do things properly, in n log(n) time. Point 1 remains.