An Enhanced in- Depth Packet Inspection based on Hierarchical Pattern Matching Algorithm
Abstract
Keywords
Full Text:
PDFReferences
N. Tuck, T. Sherwood, B. Calder, and G. Varghese, “Deterministic Memory Efficient String Matching Algorithms for Intrusion Detection,” Proc. IEEE INFOCOM ‟04, Mar. 2004.
A.V. Aho and M.J. Corasick, “Efficient String Matching: An Aid to Bibliographic Search,” Comm. ACM, vol. 18, no. 6, pp. 330-340, June 1975.
T.-F. Sheu, N.-F. Huang and H.-P. Lee, “A Novel Hierarchical Matching Algorithm for Intrusion Detection Systems,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM ‟05), Nov. 2005.
S. Antonatos, K.G. Anagnostakis, and E.P. Markatos, “Generating Realistic Workloads for Network Intrusion Detection Systems,” Proc. Fourth Int‟l ACM Workshop Software and Performance (WOSP), 2004.
S. Antonatos, M. Polychronakis, P. Akritidis, K.G. Anagnostakis, and E.P. Markatos, “Piranha: Fast and Memory-Efficient Pattern Matching for Intrusion Detection,” Proc. 20th IFIP Int‟l Information Security Conf. (SEC ‟05), May 2005.
Kapill Kumar Gupta, Baikunth Nath, and Ramamohanarao Kotagiri,“layered approach using Conditional random fields for intrusion detection” Proc. IEEE Transactions on dependable and secure computing, January-march 2010.
Kapill Kumar Gupta, Baikunth Nath, and R. Kotagiri, “Conditional Random Fields for Intrusion Detection,” Proc. 21st Int‟l Conf. Advanced Information Networking and Applications Workshops (AINAW ‟07), pp. 203-208, 2007.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.