The University of Southampton
University of Southampton Institutional Repository

Fast algorithm for deep packet inspection

Fast algorithm for deep packet inspection
Fast algorithm for deep packet inspection

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.

Aho-Corasick, Deep Packet Inspection, Finite State Automata
1865-0929
102-111
Barbary, Salam
fe0032b5-530c-44a9-b266-0e4ba070413d
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6
Challita, Khalil
d763f952-da59-4221-9fc7-265bfc9aa3d7
Benlamri, Rachid
Barbary, Salam
fe0032b5-530c-44a9-b266-0e4ba070413d
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6
Challita, Khalil
d763f952-da59-4221-9fc7-265bfc9aa3d7
Benlamri, Rachid

Barbary, Salam, Farhat, Hikmat and Challita, Khalil (2012) Fast algorithm for deep packet inspection. Benlamri, Rachid (ed.) In Networked Digital Technologies - 4th International Conference, NDT 2012, Proceedings. vol. 293 PART 1, pp. 102-111 . (doi:10.1007/978-3-642-30507-8_10).

Record type: Conference or Workshop Item (Paper)

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 record has no associated files available for download.

More information

Published date: 12 December 2012
Venue - Dates: 4th International Conference on Networked Digital Technologies, NDT 2012, , Dubai, United Arab Emirates, 2012-04-24 - 2012-04-26
Keywords: Aho-Corasick, Deep Packet Inspection, Finite State Automata

Identifiers

Local EPrints ID: 492305
URI: http://eprints.soton.ac.uk/id/eprint/492305
ISSN: 1865-0929
PURE UUID: 3d997a32-a4e1-4327-a55e-7fdd4a5f8a0a
ORCID for Hikmat Farhat: ORCID iD orcid.org/0000-0002-5043-227X

Catalogue record

Date deposited: 23 Jul 2024 17:13
Last modified: 24 Jul 2024 02:06

Export record

Altmetrics

Contributors

Author: Salam Barbary
Author: Hikmat Farhat ORCID iD
Author: Khalil Challita
Editor: Rachid Benlamri

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×