Abstract
Efficient Matching multiple keywords against a stream of input is still an important task. This is essential for deep packet inspection where multi-keyword matching has to be done at wire-speed. While the Aho-Corasick algorithm is one of the best use algorithm, the efficiency of the algorithm depends on the implementation of the required data structures and the goto function. In this paper, an optimized implementation of the trie of the Aho-Corasick algorithm is presented. The key idea is to use a prime number signature to reduce the number of lookups. The performance of the suggested algorithm, in space and time, is compared with different implementations in use today.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18, 333–340 (1975)
Congdon, P., Farrens, M., Mohapatra, P.: Packet prediction for speculative cut-through switching. In: Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2008, pp. 99–108 (2008)
Dori, S., Landau, G.M.: Construction of aho corasick automaton in linear time for integer alphabets. Inf. Process. Lett. 98, 66–72 (2006)
Flouri, T., Melichar, B., Janoušek, J.: Aho-corasick like multiple subtree matching by pushdown automata. In: Proceedings of the 2010 ACM Symposium on Applied Computing, SAC 2010, pp. 2157–2158 (2010)
Kumar, S., Turner, J., Williams, J.: Advanced algorithms for fast and scalable deep packet inspection. In: Proceedings of the 2006 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2006, pp. 81–92 (2006)
Peng, K., Tang, S., Chen, M., Dong, Q.: Chain-based dfa deflation for fast and scalable regular expression matching using tcam. In: Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, ANCS 2011, pp. 24–35 (2011)
Smith, R., Estan, C., Jha, S., Kong, S.: Deflating the big bang: fast and scalable deep packet inspection with extended finite automata. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, SIGCOMM 2008, pp. 207–218 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbary, S., Farhat, H., Challita, K. (2012). Fast Algorithm for Deep Packet Inspection. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-30507-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30506-1
Online ISBN: 978-3-642-30507-8
eBook Packages: Computer ScienceComputer Science (R0)