CERTIFICATE

IMPACT FACTOR 2021

Subject Area

  • Life Sciences / Biology
  • Architecture / Building Management
  • Asian Studies
  • Business & Management
  • Chemistry
  • Computer Science
  • Economics & Finance
  • Engineering / Acoustics
  • Environmental Science
  • Agricultural Sciences
  • Pharmaceutical Sciences
  • General Sciences
  • Materials Science
  • Mathematics
  • Medicine
  • Nanotechnology & Nanoscience
  • Nonlinear Science
  • Chaos & Dynamical Systems
  • Physics
  • Social Sciences & Humanities

Why Us? >>

  • Open Access
  • Peer Reviewed
  • Rapid Publication
  • Life time hosting
  • Free promotion service
  • Free indexing service
  • More citations
  • Search engine friendly

A high throughput pattern matching using byte filtered bit_split algorithm

Author: 
Jennifer Christy, J., Manikandababu, C.S. and Rathish, C.R
Subject Area: 
Physical Sciences and Engineering
Abstract: 

The phenomenal growth of the Internet in the last decade and society's increasing dependence on it has brought along, a flood of security attacks on the networking and computing infrastructure. Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Essential to almost every intrusion detection system is the ability to search through packets and identify content that matches known attacks. Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of almost every modern intrusion detection system is a pattern matching algorithm. Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. Here modifications to the Aho-Corasick pattern-matching algorithm are proposed that drastically reduce the amount of memory required and improve its performance. For Snort rule sets, the new algorithm achieves 30% of memory reduction compared with the traditional Aho–Corasick algorithm. In addition, we can gain further reduction in memory by integrating our approach to the bit-split algorithm which is the state-of-the-art memory-based approach.

PDF file: 

CALL FOR PAPERS

 

ONLINE PAYPAL PAYMENT

IJMCE RECOMMENDATION

Advantages of IJCR

  • Rapid Publishing
  • Professional publishing practices
  • Indexing in leading database
  • High level of citation
  • High Qualitiy reader base
  • High level author suport

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

 

EDITORIAL BOARD

CHUDE NKIRU PATRICIA
Nigeria
Dr. Swamy KRM
India
Dr. Abdul Hannan A.M.S
Saudi Arabia.
Luai Farhan Zghair
Iraq
Hasan Ali Abed Al-Zu’bi
Jordanian
Fredrick OJIJA
Tanzanian
Firuza M. Tursunkhodjaeva
Uzbekistan
Faraz Ahmed Farooqi
Saudi Arabia
Eric Randy Reyes Politud
Philippines
Elsadig Gasoom FadelAlla Elbashir
Sudan
Eapen, Asha Sarah
United State
Dr.Arun Kumar A
India
Dr. Zafar Iqbal
Pakistan
Dr. SHAHERA S.PATEL
India
Dr. Ruchika Khanna
India
Dr. Recep TAS
Turkey
Dr. Rasha Ali Eldeeb
Egypt
Dr. Pralhad Kanhaiyalal Rahangdale
India
DR. PATRICK D. CERNA
Philippines
Dr. Nicolas Padilla- Raygoza
Mexico
Dr. Mustafa Y. G. Younis
Libiya
Dr. Muhammad shoaib Ahmedani
Saudi Arabia
DR. MUHAMMAD ISMAIL MOHMAND
United State
DR. MAHESH SHIVAJI CHAVAN
India
DR. M. ARUNA
India
Dr. Lim Gee Nee
Malaysia
Dr. Jatinder Pal Singh Chawla
India
DR. IRAM BOKHARI
Pakistan
Dr. FARHAT NAZ RAHMAN
Pakistan
Dr. Devendra kumar Gupta
India
Dr. ASHWANI KUMAR DUBEY
India
Dr. Ali Seidi
Iran
Dr. Achmad Choerudin
Indonesia
Dr Ashok Kumar Verma
India
Thi Mong Diep NGUYEN
France
Dr. Muhammad Akram
Pakistan
Dr. Imran Azad
Oman
Dr. Meenakshi Malik
India
Aseel Hadi Hamzah
Iraq
Anam Bhatti
Malaysia
Md. Amir Hossain
Bangladesh
Ahmet İPEKÇİ
Turkey
Mirzadi Gohari
Iran