IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 9    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 9, September 2011
Application level load balancing in a web switch or security oriented filtering based on the content signatures for deep packet inspection and delayed input DFA
Full Text(PDF, 3000)  PP.  
Author(s)
Madhuri Katabathuni, Suman Maloji, Rajasekhar Rao Kurra
KEYWORDS
DFA, Regular expressions, deep packet inspection, Network Intrusion Detection, Security, NFA and Delayed input DFA called D2FA
ABSTRACT
There is a growing demand for network devices capable of examining the content of the Data packet in order to improve the network security and provide application specific services. Most high performance systems that perform deep packet inspection implement simple string matching algorithms to match packets against a large but finite set of strings .However there is a growing interest in using regular expressions based pattern matching. Since regular expressions offer Superior expressive power and flexibility. DFA representations are typically used to represent the regular expressions. However the DFA representation of regular expressions sets arising in network applications requires large amount of memory, limiting their practical application
References
1. J.E hopcraft and J.D Ullman introduction to Automata theory and computation.

2. S. Antonatos Generating realistic work load for network intrusion detection systems.

3. Fang Yu et all Fast and memory efficient regular expressions S. Antonatos, et. al, “Generating realistic workloads for network intrusion detection systems,” In ACM Workshop on Software and Performance, 2004.

4. A. V. Aho and M. J. Corasick, “Efficient string matching: An aid to bibliographic search,” Comm. of the ACM, 18(6):333–340, 1975. B. Commentz-Walter, “A string matching algorithm fast on the average,” Proc. of ICALP, pages 118–132, July 1979.

5. S. Wu, U. Manber,” A fast algorithm for multi-pattern searching,” Tech. R. TR-94-17, Dept. of Comp. Science, Univ of Arizona, 1994. Fang Yu, et al., “Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection”, UCB tech. report, EECS-2005-8.

6. N. Tuck, T. Sherwood, B. Calder, and G. Varghese, “Deterministic memory-efficient string matching algorithms for intrusion detection,” IEEE Infocom 2004, pp. 333--340.

Untitled Page