CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Centralized Parallel form of Pattern Matching Algorithm in Packet Inspection by Efficient Utilization of Secondary Memory in Network Processor

by N. Kanniya Raja, K. Arulanandam, B. Raja Rajeswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 5
Year of Publication: 2012
Authors: N. Kanniya Raja, K. Arulanandam, B. Raja Rajeswari
10.5120/4951-7194

N. Kanniya Raja, K. Arulanandam, B. Raja Rajeswari . Centralized Parallel form of Pattern Matching Algorithm in Packet Inspection by Efficient Utilization of Secondary Memory in Network Processor. International Journal of Computer Applications. 40, 5 ( February 2012), 12-17. DOI=10.5120/4951-7194

@article{ 10.5120/4951-7194,
author = { N. Kanniya Raja, K. Arulanandam, B. Raja Rajeswari },
title = { Centralized Parallel form of Pattern Matching Algorithm in Packet Inspection by Efficient Utilization of Secondary Memory in Network Processor },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 40 },
number = { 5 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 12-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number5/4951-7194/ },
doi = { 10.5120/4951-7194 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:27:16.718543+05:30
%A N. Kanniya Raja
%A K. Arulanandam
%A B. Raja Rajeswari
%T Centralized Parallel form of Pattern Matching Algorithm in Packet Inspection by Efficient Utilization of Secondary Memory in Network Processor
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 5
%P 12-17
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The network equipment has capable of inspecting packets in order to discover the worms and virus over the network. Many network users are hacked by attackers through malicious functions are mapped on network applications. Such unauthorized activities are required to delete by deep packet inspection in application layer. The high level network equipment provides in-depth packet inspection through pattern matching in network detection system. By presenting centralized parallel pattern matching algorithm for efficient packet inspection with network processor and coprocessor in order to retrieve the pattern with less time.

References
  1. Snort, http://www.snort.org, 2008.
  2. 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.
  3. R.N. Horspool, “Practical Fast Searching in Strings,” Software Practice and Experience, vol. 10, no. 6, pp. 501-506, 1980.
  4. 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.
  5. M. Fisk and G. Varghese, “Fast Content-Based Packet Handling for Intrusion Detection,” UCSD Technical Report CS2001-0670,May 2001.
  6. S. Lakshmanamurthy, K.-Y. Liu, Y. Pun, L. Huston, and U. Naik,“Network Processor Performance Analysis Methodology,” Intel Technology J., vol. 6, Aug. 2002.
  7. S. Wu and U. Manber, “A Fast Algorithm for Multi-Pattern Searching,” Technical Report TR94-17, Dept. Computer Science,Univ. of Arizona, May 1994.
  8. E. Markatos, S. Antonatos, M. Polychronakis, and K. Anagnostakis, “Exclusion-Based Signature Matching for Intrusion Detection,” Proc. IASTED Int’l Conf. Comm. and Computer Networks (CCN ’02), Oct. 2002.
  9. R.-T. Liu, N.-F. Huang, C.-H. Chen, and C.-N. Kao, “A Fast String Matching Algorithm for Network Processor-Based Intrusion Detection System,” ACM Trans. Embedded Computing Systems,vol. 3, no. 3, Aug. 2004.
  10. R.S. Boyer and J.S. Moor, “A Fast String Searching Algorithm,”Comm. ACM, vol. 20, no. 10, pp. 762-772, Oct. 1977.
  11. C.J. Coit, S. Staniford, and J. McAlerney, “Towards Faster String Matching for Intrusion Detection or Exceeding the Speed of Snort,” Proc. Second DARPA Information Survivability Conf. and Exposition (DISCEX), 2001.
  12. 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.
  13. S. Kim and Y. Kim, “A Fast Multiple String-Pattern Matching Algorithm,” Proc. 17th AoM/IAoM Int’l Conf. Computer Science,Aug. 1999.
  14. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J.Lockwood, “Deep Packet Inspection Using Parallel Bloom Filters,” Proc. 11th Symp. High Performance Interconnects, Aug.2003.
  15. Vitesse Network Processors, http://www.vitesse.com, 2008.
  16. Intel Network Processors, http://www.intel.com/design/network/products/npfamily/index.htm, 2008.
  17. C. Kruegel, F. Valeur, G. Vigna, and R. Kemmerer, “Stateful Intrusion Detection for High-Speed Networks,” Proc. IEEE Symp.Security and Privacy (SP ’02), May 2002.
  18. M. Handley, V. Paxson, and C. Kreibich, “Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics,” Proc. Ninth USENIX Security Symp., 2000.
Index Terms

Computer Science
Information Sciences

Keywords

Intrusion detection Pattern matching Packet inspection Packet payload

Powered by PhDFocusTM