Henning,
On 02/11/2021 14:57, Henning Rogge wrote:
On Tue, Nov 2, 2021 at 12:07 PM Peter Psenak <ppsenak@xxxxxxxxx> wrote:
Hi Henning,
In chapter 6.1-6.3 (7.1-7.3 for OSPF) you define a subset of "boolean algebra"
among the extended admin groups. I assume that more complex boolean conditions
are not necessary for most deployments (and could be done by defining more EAGs
that represent the specific condition)?
##PP
the include/exclude rules that we defined have been used in traditional
RSVP-TE for a long time. They have proved to be sufficient. We can
always add more if needed in the future.
I wonder if it can make sense to allow multiple include/exclude-All
TLVs and define the "ANY logic" based on the fact that it's enough
that one sub-TLV "ALL" condition is met.
This might allow for a more flexible system, but I am not sure it's
worth the complexity in this case.
multiple include/exclude TLVs can be specified in the FAD. In such case,
constraints in all of these TLVs must be met during the flex-algo
calculation. So it's a logical AND between these TLVs. What you suggest
is to allow OR logic between TLVs. I don't see the need for that as you
can perform both AND and OR operation with the individual affinities -
include/exclude ANY is the logical OR operation, include ALL is the
logical AND operation.
I believe what we have is sufficient for now. If needed we can extend in
the future.
thanks,
Peter
Henning Rogge
--
last-call mailing list
last-call@xxxxxxxx
https://www.ietf.org/mailman/listinfo/last-call
