earticle

논문검색

Transfer Model Based on State of Finite Semi-Markov Automata Intrusion Tolerance

초록

영어

Existing network security technology may not against most of intrusion so that we need to study intrusion tolerance technology. On the basis of existing model of intrusion tolerance, we putted forward an optimization of finite automata state transition model in intrusion tolerance system by adding strategy and updating status. Since the conversion process between the states of the model meets Semi-Markov theory, therefore, the model can be used to quantify this theory; it gives calculation process of the steady probability by each state. By stabilizing the probabilistic analysis of each state, provide theoretical guidance and basis for network management personnel to better maintain network security .Proven, the Semi-Markov applied to finite automata intrusion tolerant system is feasible, effective, and has simple features.

목차

Abstract
 1. Introduction
 2. Optimization of Intrusion Tolerance System State Transition Model
 3. Finite Automata Analysis Intrusion Tolerance System
  3.1. NDFSA Intrusion Tolerance System
  3.2. Intrusion Tolerance System Finite Automata Working Process
 4. Semi-Markov Process of Finite Automata Quantization
  4.1. State Transition Model DTMC
  4.2. Stable Probability Finite Automata
 5. Numerical Analysis Results
  5.1. Test Network Environment
  5.2. Finite Automata System Data Calculation and Analysis
 6. Conclusion
 Acknowledgements
 References

저자정보

  • Wang Guangze Harbin University of Science and Technology, Harbin 150080, Heilongjiang Province, China
  • Wang Peng Harbin University of Science and Technology, Harbin 150080, Heilongjiang Province, China
  • Luo Zhiyong Harbin University of Science and Technology, Harbin 150080, Heilongjiang Province, China
  • Zhu Suxia Harbin University of Science and Technology, Harbin 150080, Heilongjiang Province, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.