Bouma2 --一种准无状态、可调的多串匹配算法
Bouma2 - A Quasi-Stateless, Tunable Multiple String-Match Algorithm
摘要：
Bouma 2算法试图通过提出一种“准无状态”方法来挑战流行的“有状态”精确字符串匹配范例。我们声称，使用状态机来解决多个精确字符串匹配问题引入了一个隐藏的人工约束，即消费顺序依赖，这会导致不必要的开销。Bouma 2在这个意义上不受限制;我们假设这允许内存效率和改进的性能与其状态机等价物。Bouma 2预处理问题的核心是一个加权的线性规划问题，可以针对内存占用和性能优化进行调整。具体而言，这使得Bouma 2对输入敏感，因为可以根据输入特性进行调谐。评估Bouma 2对Aho-Corasick变体的流行的Snort入侵防御系统，我们证明了一倍的吞吐量，同时使用约10%的内存。
英文摘要：
The Bouma2 algorithm attempts to challenge the prevalent "stateful" exact string-match paradigms by suggesting a "quasi-stateless" approach. We claim that using state-machines to solve the multiple exact string-match problem introduces a hidden artificial constraint, namely the Consume-Order Dependency, which results in unnecessary overhead. Bouma2 is not restricted in this sense; we postulate that this allows memory-efficiency and improved performance versus its state-machine equivalents. The heart of the Bouma2 preprocessing problem is formulated as a weighted Integer Linear Programming problem, that can be tuned for memory footprint and performance optimization. Specifically, this allows Bouma2 to be input-sensitive, as tuning can be based on input characteristics. Evaluating Bouma2 against the Aho-Corasick variant of the popular Snort Intrusion Prevention System, we demonstrate double the throughput while using about 10% of the memory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
