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

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Zhang, S., Sun, Y., Meng, F., Fu, Y., Jia, B., & Wu, Z. (2020). XWM: a high-speed matching algorithm for large-scale URL rules in wireless surveillance applications. Multimedia Tools and Applications, 79(23–24), 16245–16263. https://doi.org/10.1007/s11042-019-07822-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free