An Improved WM Pattern Matching Algorithm Based on Cuckoo Filter
Pattern matching algorithms are widely used in fields such as traffic classification and management, user behavior analysis, and more. The increasingly large and complex network traffic poses significant challenges to feature matching processes. The cuckoo filter, capable of quickly determining whether an element is in a set, can be combined with pattern matching algorithms to accelerate feature matching. Building upon previous research, we propose an improved Wu-Manber (WM) algorithm that further reduces the size of the hash table generated during preprocessing, decreases the number of hash computations, and incorporates a cuckoo filter to eliminate unmatched text prefixes. This improved WM algorithm considers factors affecting algorithm performance, such as the large scale of the pattern set and the prevalence of repeated pattern string suffixes. Experimental results demonstrate that our proposed algorithm, Fast Parallel Wu-Manber (FSPRWM), significantly enhances matching speed while effectively reducing memory consumption.
Authors
- Jiangyi Liu (ORCID: https://orcid.org/0000-0001-6525-4659)
- Mingyuan Ren (ORCID: https://orcid.org/0000-0003-3835-1001)
- Shusheng Li (ORCID: https://orcid.org/0000-0002-8799-6394)
- Menglan Hu (ORCID: https://orcid.org/0000-0003-2800-4348)
- Zhiyong Zha
- Bin Luo (ORCID: https://orcid.org/0000-0002-9036-0063)
- Kai Peng (ORCID: https://orcid.org/0000-0001-9910-4237)
- Wenfeng Xu
Institutions
- J-Power (Japan) (JP)
- State Grid Corporation of China (China) (CN)
- Huazhong University of Science and Technology (CN)
Publication Details
- Published
- 2024-12-13
- DOI
- https://doi.org/10.1109/hpcc64274.2024.00129
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Research and Development