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

["Acee Lindem (acee)" <[e-mail]>]

Speaking as WG Member:

Hi Authors,

I have a couple technical comments on the draft.


  1.  The algorithm only computes a single graph with single path to each node. While I-D.ietf-lsr-dynamic-flooding failure and computation of an updated flooding topology, many of the other algorithms (both draft and proprietary) attempt to compute two or more paths to each node.
  2.  Since this algorithm is slated for use as a distributed algorithm, all routers in the area must use the same value for MaxD or they may compute different flooding topologies. This is cannot be guaranteed by a single algorithm IANA value unless we allow some number of algorithm specific parameters to be advertised by the area leader (which might not be a bad idea).
  3.   Similarly, the constraints in section 4.2 must be applied uniformly and different constraints would require new IANA algorithm allocation.

Thanks,
Acee

From: Lsr <[e-mail]> on behalf of "Acee Lindem (acee)" <acee=[e-mail]>
Date: Friday, May 15, 2020 at 3:40 PM
To: "[e-mail]" <[e-mail]>
Subject: [Lsr] Flooding Topology Computation Algorithm - draft-cc-lsr-flooding-reduction-08 Working Group Adoption Call

This begins a 3 week (due to holidays) WG adoption call for the “Flooding Topology Computation Algorithm” draft. Please issue your support or objection to this list by 11:59 PM, UTC on June 5th, 2020. Here is a URL for your convenience.

https://datatracker.ietf.org/doc/draft-cc-lsr-flooding-reduction/

Thanks,
Acee