Freertr folks have just published (I didn’t look into the details of their implementation though):

“rare/freertr just got fib compression.. in our nren, the v4 table can be compressed from 900k to 260k, the v6 table from 160k to 52k... the tofino2 asic with our dataplane code ( https://lnkd.in/dJrHVZqE ) can accomodate 520k v4 and 130k v6”

On a none related note - they are also implementing RIFT, we plan testing against Junos and Python OpenSource implementations during IETF 116 hackathon.

Cheers,
Jeff

On Jan 6, 2023, at 17:13, Matthew Walster via NANOG <nanog@nanog.org> wrote:




On Fri, 6 Jan 2023, 18:38 Mike Hammett, <nanog@ics-il.net> wrote:
I suspect it always will have value, whether it's peering routers, POP routers, multi-homed customer routers, etc.

Indeed. It's not "clean" but it is an acceptable tradeoff if you know what you're doing, and how traffic sloshes around etc.

I wrote a tool once that took a number of BGP feeds and aggregated the prefixes based on the next-hop values, which was *amazingly* good at reducing FIB sizes, but consumed so much CPU and memory, not to mention the latency of updates during any sizeable churn event, that it proved less useful than just precomputing based on historical traffic flows and updating the lists semi-frequently.

The idea of Juniper's EPE etc is very attractive, and largely matches what I had done back then, but does it with a lot more finesse. Ultimately, it's a tradeoff between CapEx of the high FIB router and the OpEx of the engineers who have to maintain the often hacky solution ;)


M