Hi Gyan,
Thanks much for your questions. My answers/explanations are inline below.
Best Regards,
Huaimo
________________________________
From: Gyan Mishra <[email protected]>
Sent: Friday, May 22, 2020 8:41 PM
To: Huaimo Chen <[email protected]>
Cc: Acee Lindem (acee) <[email protected]>; [email protected] <[email protected]>
Subject: Re: [Lsr] Flooding Topology Computation Algorithm -
draft-cc-lsr-flooding-reduction-08 Working Group Adoption Call
Hi Huaimo
Thank you for the slide deck. That really helps understand the algorithm.
I will let you know if I have any questions.
The goal of the algorithm is to speed up convergence by limiting the
convergence scope and expanding out 1 link at a time until all nodes and links
are part of the flood scope. From the examples in the slide deck I did not see
mentioned what is done with the dynamic flooding algorithm where when you have
a meshed network in the slide 5 examples, how do you limit the flooding on
redundant links duplicate flooding with the many meshed paths as you
iteratively grow the FT nodes scope Cq(). I believe with the dynamic flooding
it does a degree of 2 so 2 links between nodes.
[HC]: The slide 5 example illustrates step 4 of the algorithm in section 4.1.
When the algorithm reaches this step, all the nodes are on the FT, but some of
them may have degree of 1 (i.e., one link on the FT connected to the node).
This step makes sure that every node on the FT has degree of at least 2. It
seems that the dynamic flooding expects the FT having its every node with
degree of at least 2 for redundancy. In the Dynamic Flooding on Dense Graphs,
link states will be flooded over the links on the FT. For example, for a node
with degree of N (e.g., 3), when the node receives a link state from one link
on the FT, it will flood the link state to the other N-1 (e.g., 3-1=2) links on
the FT.
I think with clos spine leaf the mesh is much more intensive and problematic
with ECMP then a circular topology nodal mesh that results in duplicate
redundant flooding that slows down convergence. With spine leaf it’s like an X
horizontal width axis and then depth is spine to leaf links. With spine leaf
as you grow sideways and the spine expand the redundant ECMP grows and
redundant flooding grows exponentially and is much worse then circular nodal
mesh.
[HC]: In the slides, a full mess topology is used to illustrate the algorithm
in some details. The algorithm can be used to compute FT for any other topology
such as clos spine leaf. For topology with M (e.g., 100) parallel links between
any pair of nodes X and Y, the algorithm will just add one link to the FT
between X and Y, the other M - 1 (e.g., 100-1 = 99) links will not be added to
the FT. Thus the link states will flood over only this one link between X and Y
on the FT and will not flood over the other M - 1 (e..g., 100 - 1 = 99) links,
which are not on the FT.
Thank you
Gyan
_______________________________________________
Lsr mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/lsr
