XWM: a high-speed matching algorithm for large-scale URL rules in wireless surveillance applications

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-Manb...

Full description

Saved in:
Bibliographic Details
Published inMultimedia tools and applications Vol. 79; no. 23-24; pp. 16245 - 16263
Main Authors Zhang, Shuzhuang, Sun, Yanbin, Meng, Fanzhi, Fu, Yunsheng, Jia, Bowei, Wu, Zhigang
Format Journal Article
LanguageEnglish
Published New York Springer US 01.06.2020
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1380-7501
1573-7721
1573-7721
DOI10.1007/s11042-019-07822-8

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1380-7501
1573-7721
1573-7721
DOI:10.1007/s11042-019-07822-8