Matching algorithms for intrusion detection system based on DNA encoding

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied on NSL-KDD dataset. The obtained results showed that the average time for matching for all NSL-KDD dataset records, based on Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris–Pratt algorithm are equal to 18.4, 11.5, 9.23, 7.5, and 23.2 seconds respectively. These results demonstrated that using single algorithm achieved better time than combined algorithms, and Knuth-Morris-Pratt algorithm gives the best result than the rest of the other three algorithms. The results are reasonable and acceptable when they are compared with previous systems.

Original languageEnglish
Pages (from-to)8410-8420
Number of pages11
JournalJournal of Theoretical and Applied Information Technology
Volume96
Issue number24
Publication statusPublished - 31 Dec 2018

Fingerprint

Intrusion detection
Intrusion Detection
Matching Algorithm
Encoding
DNA
Time-average

Keywords

  • Boyer-Moore algorithm
  • DNA encoding
  • Intrusion detection
  • Knuth-Morris-Pratt algorithm
  • Pattern matching algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Matching algorithms for intrusion detection system based on DNA encoding. / Rashid, Omar Fitian; Ali Othman, Zulaiha; Zainudin, Suhaila.

In: Journal of Theoretical and Applied Information Technology, Vol. 96, No. 24, 31.12.2018, p. 8410-8420.

Research output: Contribution to journalArticle

@article{7d5c1ddbd0f54425a1aaaf748604bfa6,
title = "Matching algorithms for intrusion detection system based on DNA encoding",
abstract = "Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied on NSL-KDD dataset. The obtained results showed that the average time for matching for all NSL-KDD dataset records, based on Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris–Pratt algorithm are equal to 18.4, 11.5, 9.23, 7.5, and 23.2 seconds respectively. These results demonstrated that using single algorithm achieved better time than combined algorithms, and Knuth-Morris-Pratt algorithm gives the best result than the rest of the other three algorithms. The results are reasonable and acceptable when they are compared with previous systems.",
keywords = "Boyer-Moore algorithm, DNA encoding, Intrusion detection, Knuth-Morris-Pratt algorithm, Pattern matching algorithm",
author = "Rashid, {Omar Fitian} and {Ali Othman}, Zulaiha and Suhaila Zainudin",
year = "2018",
month = "12",
day = "31",
language = "English",
volume = "96",
pages = "8410--8420",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "24",

}

TY - JOUR

T1 - Matching algorithms for intrusion detection system based on DNA encoding

AU - Rashid, Omar Fitian

AU - Ali Othman, Zulaiha

AU - Zainudin, Suhaila

PY - 2018/12/31

Y1 - 2018/12/31

N2 - Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied on NSL-KDD dataset. The obtained results showed that the average time for matching for all NSL-KDD dataset records, based on Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris–Pratt algorithm are equal to 18.4, 11.5, 9.23, 7.5, and 23.2 seconds respectively. These results demonstrated that using single algorithm achieved better time than combined algorithms, and Knuth-Morris-Pratt algorithm gives the best result than the rest of the other three algorithms. The results are reasonable and acceptable when they are compared with previous systems.

AB - Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied on NSL-KDD dataset. The obtained results showed that the average time for matching for all NSL-KDD dataset records, based on Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris–Pratt algorithm are equal to 18.4, 11.5, 9.23, 7.5, and 23.2 seconds respectively. These results demonstrated that using single algorithm achieved better time than combined algorithms, and Knuth-Morris-Pratt algorithm gives the best result than the rest of the other three algorithms. The results are reasonable and acceptable when they are compared with previous systems.

KW - Boyer-Moore algorithm

KW - DNA encoding

KW - Intrusion detection

KW - Knuth-Morris-Pratt algorithm

KW - Pattern matching algorithm

UR - http://www.scopus.com/inward/record.url?scp=85059476345&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059476345&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85059476345

VL - 96

SP - 8410

EP - 8420

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 24

ER -