XWM: a high-speed matching algorithm for large-scale URL rules in wireless surveillance applications
| Autor: | Shuzhuang Zhang, Yunsheng Fu, Bowei Jia, Fanzhi Meng, Yanbin Sun, Zhigang Wu |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Matching (statistics)
Computer Networks and Communications Computer science Hash function String (computer science) 020207 software engineering 02 engineering and technology String searching algorithm Hash table Computer engineering Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Media Technology Wireless sensor network Software Blossom algorithm |
| Zdroj: | Multimedia Tools and Applications. 79:16245-16263 |
| ISSN: | 1573-7721 1380-7501 |
| DOI: | 10.1007/s11042-019-07822-8 |
| Popis: | Large-scale high-speed URL matching is a key operation in many network security systems and surveillance applications in Wireless Sensor Networks. Classic string matching algorithms are unsuitable for large-scale URL filtering due to speed or memory consumption. This paper proposes an extend Wu-Manber algorithm (XWM) which takes advantage of the encoding characteristics of the URL greatly to improve the matching performance of the algorithm. It first adopts the pattern string window selection method to optimize Wu-Manber’s hash process, and then combines hash tables and associative containers to optimize the string comparison process. The experimental results on actual 10 million patterns show that XWM can achieve speeds that are twice as fast as traditional algorithms, especially when the shortest pattern string length is longer, it is more advantageous. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink