• Title/Summary/Keyword: Time-Dependent Finite Automata (TDFA)

Search Result 1, Processing Time 0.017 seconds

SYN Flood DoS Detection System Using Time Dependent Finite Automata

  • Noura AlDossary;Sarah AlQahtani;Reem Alzaher;Atta-ur-Rahman
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.6
    • /
    • pp.147-154
    • /
    • 2023
  • Network intrusion refers to any unauthorized penetration or activity on a computer network. This upsets the confidentiality, integrity, and availability of the network system. One of the major threats to any system's availability is a Denial-of-Service (DoS) attack, which is intended to deny a legitimate user access to resources. Therefore, due to the complexity of DoS attacks, it is increasingly important to abstract and describe these attacks in a way that will be effectively detected. The automaton theory is used in this paper to implement a SYN Flood detection system based on Time-Dependent Finite Automata (TDFA).