Gabor LENCSE writes: > If you are interested, you can find the results in Tables 18 - 20 of > this (open access) paper: https://doi.org/10.1016/j.comcom.2023.08.009
Thanks for the pointer -- that's a very interesting paper. After giving it a quick read through, one thing immediately jumps out. The paper mentions (section A.4) a boost in performance after increasing the state table size limit. Not having looked at the relevant code, so I'm guessing here, but this is a classic indicator of a hashing algorithm falling apart when the table gets close to full. Could it be that simple? I need to go digging into the pf code for a closer look. You also describe how the performance degrades over time. This exactly matches the behaviour we see. Could the fix be as simple as cranking 'set limit states' up to, say, two milltion? There is one way to find out ... :-) --lyndon
