在网络包处理,高效的字符串查找系统是很重要的。在这篇文章,扩大花蕾过滤器数据结构被介绍支持值检索字符串查找,并且改进它的性能,加权的扩大花蕾过滤器(WEBF ) 结构被概括。WEBF 的最佳的配置然后被导出,并且它超过传统的花蕾过滤器,这被显示出。最后,一片应用相关的集成电路(ASIC ) 基于技术使用 WEBF 被构画出。
in network packet processing, high-performance string lookup systems are very important. In this article, an extended Bloom filter data structure is introduced to support value retrieval string lookup, and to improve its performance, a weighted extended Bloom filter (WEBF) structure is generalized. The optimal configuration of the WEBF is then derived, and it is shown that it outperforms the traditional Bloom filter. Finally, an application-specific integrated circuit (ASIC)-based technique using WEBF is outlined.