IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v19y2025i1p1-24.html
   My bibliography  Save this article

Minimal DFA With Optimization of Pattern Matching (MDFAOPM) for Network Traffic Analysis and Attacks

Author

Listed:
  • Krishna Kishore Thota

    (Sathyabama Institute of Science and Technology, India)

  • R. Jeberson Retna Raj

    (Sathyabama Institute of Science and Technology, India)

Abstract

IIn today's network security, network intrusion detection systems (NIDS) play an increasingly crucial role in detecting and averting harmful network attacks. This study presents an innovative and efficient string-matching algorithm, called Minimal Deterministic Finite Automata with Optimization of Pattern Matching (MDFAOPM), that has the benefits of high performance, compact memory and Time analysis. The suggested MDFAOPM, whether it is implemented in software or hardware, considerably reduces the memory required without sacrificing high performance by utilizing the magic state properties found from deterministic finite state automata. Additionally, the MDFAOPM algorithm has great flexibility in that it may be adjusted to meet particular resource and performance requirements. The experimental findings demonstrate that MDFAOPM outperforms other systems by more than 21.25% in hardware implementation and 21 times in software implementation compared to Deterministic Finite Automata (DFA).

Suggested Citation

  • Krishna Kishore Thota & R. Jeberson Retna Raj, 2025. "Minimal DFA With Optimization of Pattern Matching (MDFAOPM) for Network Traffic Analysis and Attacks," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 19(1), pages 1-24, January.
    • Handle: RePEc:igg:jisp00:v:19:y:2025:i:1:p:1-24
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.384918
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisp00:v:19:y:2025:i:1:p:1-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.