Packet filter specifically designed for speed
This is a candidate for deletion: Links broken. From the maintainer "This was a research project from 2004 . It is long dead now. It's probably best to remove the entry". Poppy-one (talk) 14:23, 29 July 2018 (EDT)
The fairly fast packet filter (FFPF) adds many new features to existing filtering solutions. It is designed for high speed by pushing computationally intensive tasks to the kernel or to network processors, and by minimising packet copying. Also, since it provides a richer programming language and explicit extensibility, it is more flexible than existing approaches. Using its extensibility, the language can even be used as a meta- filter to "script" together filters from other approaches.
29 October 2004
Leaders and contributors
|Willem de Bruijn||Maintainer|
Resources and communication
|Bug Tracking||VCS Repository Webview||http://sourceforge.net/tracker/?group_id=100310&atid=627038|
|Developer||Mailing List Info/Archive||http://lists.sourceforge.net/mailman/listinfo/ffpf-devel|
|Developer||VCS Repository Webview||http://sourceforge.net/cvs/?group_id=100310|
|Required to use||glibc|
|Required to use||binutils|
|Required to use||gcc|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.