Re: [Sidrops] WGLC = draft-ietf-sidrops-aspa-verification - ENDS 03/22/2023 (Mar 22 2023)

[Ben Maddison <[e-mail]>]

Hi Claudio,

On 03/23, Claudio Jeker wrote:
[..]
> I have a major issue with duplicating the CAS lookup table. The
> implication for BGP implementations is twice the memory consumption and
> more then double the computational cost and that in the most latency
> sensitive portion of the code. A lot of time is spent in getting the most
> performance out of BGP and so this should be a major consideration when it
> comes to ASPA validation.

Would you elaborate on this?

I get why the memory usage increases with this approach.

It's not obvious to me why the computational cost of the verification
process is higher with a per-AFI table.
Intuitively this seems like it should be a *cheaper* lookup, since you
don't have to filter for AFI at lookup-time.

I would be interested to hear whether this is the case for other BGP
implementers too.

I had previously argued that the expansion into per-AFI sets should
happen at the RP, based on the above intuition.
If I got that wrong, then I agree the VAP/RTR payload datastructure
should change to match the object profile.

Cheers,

Ben