On Wed, Oct 09, 2002 at 07:47:30PM -0700, Michael C. Wu wrote:
> Hi Luigi and Darren,
>
> Regarding IPFW2 and IPF, do you have plans on implementing a DAWG algorithm
> for the pattern matching? (Directed Acyclic Word Graphs)
my quick answer is no -- it might be interesting stuff, but
have too much stuff on my plate...
cheers
luigi
> http://citeseer.nj.nec.com/crochemore99fast.html
>
> It is a new algorithm that does super fast multiple stream/pattern
> matching in a given n-length string within O(n) .
> The traditional fastest Knuth algorithm only does
> two streams, while DAWG's do multiple streams. We use it in
> Bioinformatics research to match DNA sequences. However, I know
> for a fact that applying DAWG's to router/firewall situations
> would be very appropriate.
>
> Forgive my not knowing about our regex(3) implementation,
> what algorithm exactly does our regex(3) do/use?
>
> I was thinking that we may possibly add kernel/userland libraries
> for a DAWG regex. And I am willing to do the work.
>
> What do you think? Does anyone else have thoughts about this?
>
> Thanks,
> Michael
>
> To Unsubscribe: send mail to [EMAIL PROTECTED]
> with "unsubscribe freebsd-net" in the body of the message
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-net" in the body of the message
