Memory Efficient Deep Packet Inspection Using Transition Functions

Lakshmi, Vasanta K (2016) Memory Efficient Deep Packet Inspection Using Transition Functions. In: 8th International Conference on Communication Systems and Networks (COMSNETS), JAN 05-10, 2016, Bangalore, INDIA.

PDF 8th_COMSNETS_1_2016.pdf - Published Version Restricted to Registered users only Download (180kB) | Request a copy

Abstract

Regular expression matching is the state of the art in signature based intrusion detection systems. A regular expression matching algorithm used in intrusion detection systems is expected to process data at a speed linear in size of the incoming data and also to be able to run on network devices with limited memory. Traditional DFA and NFA based algorithms fail to meet either of these two requirements. The existing techniques try to either modify a DFA or a NFA, or combine both these to find a trade off between speed and memory requirements. The idea we propose in this paper is orthogonal to existing techniques. We propose a new approach to store a finite automaton in memory which otherwise is stored as a transition table. Our approach can be used by existing algorithms to further reduce the memory requirements with a minimal increase in the processing speed.

Item Type:	Conference Proceedings
Series.:	International Conference on Communication Systems and Networks
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	22 Oct 2016 09:10
Last Modified:	22 Oct 2016 09:10
URI:	http://eprints.iisc.ac.in/id/eprint/54983

Actions (login required)

View Item