Open AccessA Markov-Based Intrusion Tolerance Finite Automaton
Author(s) -
Li fengquan
Publication year - 2021
Publication title -
cit. journal of computing and information technology/journal of computing and information technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.169
H-Index - 27
eISSN - 1846-3908
pISSN - 1330-1136
DOI - 10.20532/cit.2020.1005178
Subject(s) - computer science , intrusion tolerance , automaton , intrusion detection system , intrusion , markov chain , finite state machine , network security , safeguard , learning automata , state (computer science) , theoretical computer science , markov model , distributed computing , markov process , computer security , algorithm , machine learning , mathematics , statistics , geochemistry , political science , law , geology
It is inevitable for networks to be invaded during operation. The intrusion tolerance technology comes into being to enable invaded networks to provide the necessary network services. This paper introduces an automatic learning mechanism of the intrusion tolerance system to update network security strategy, and derives an intrusion tolerance finite automaton model from an existing intrusion tolerance model. The proposed model was quantified by the Markov theory to compute the stable probability of each state. The calculated stable probabilities provide the theoretical guidance and basis for administrators to better safeguard network security. Verification results show that it is feasible, effective, and convenient to integrate the Markov model to the intrusion tolerance finite automaton.