Re: [Lsr] Flooding Topology Computation Algorithm - draft-cc-lsr-flooding-reduction-08 Working Group Adoption Call

[[e-mail]]

Hi,


> I have a question regarding the draft. At the end of section 3, it says if there is any change in the base topology, the flooding topology MUST be re-computed. So in case of a link failure in the base topo, it’s possible that the link is not part of the flooding topology (e.g. one of the multiple links between two nodes), it might be optimal if we can figure it out and save recalculation here.


This comment isn’t specific to this algorithm, so you’ll pardon me if I jump in.

Always recomputing the flooding topology is always a safe thing to do and for the case of a distributed algorithm is probably the safest design choice.

Doing the analysis about the change is not exactly trivial and computing the flooding topology is not that hard.  We are typically not short of CPU cycles and recomputing the flooding topology is outside of the critical convergence window, so while there is some theoretical benefit, it’s not at all clear that it’s of great practical benefit.  But it is up to those specifying the algorithm.

Regards,
Tony