• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hu Hao, Liu Yuling, Zhang Hongqi, Yang Yingjie, Ye Runguo. Route Prediction Method for Network Intrusion Using Absorbing Markov Chain[J]. Journal of Computer Research and Development, 2018, 55(4): 831-845. DOI: 10.7544/issn1000-1239.2018.20170087
Citation: Hu Hao, Liu Yuling, Zhang Hongqi, Yang Yingjie, Ye Runguo. Route Prediction Method for Network Intrusion Using Absorbing Markov Chain[J]. Journal of Computer Research and Development, 2018, 55(4): 831-845. DOI: 10.7544/issn1000-1239.2018.20170087

Route Prediction Method for Network Intrusion Using Absorbing Markov Chain

More Information
  • Published Date: March 31, 2018
  • Predictions of network intrusion intention and path are very significant for the security administrator to comprehend the possible threat behaviors of attackers deeply. Existing reports mainly focus on the path prediction under the ideal attack scenario. However, the ideal attack paths are not the real-world paths adopted by the intruders entirely. In order to predict the attack path information of network intrusion accurately and comprehensively, a novel route prediction method based on absorbing Markov chain (AMC) is proposed in this paper. Firstly, a normalization algorithm for state transition probability of AMC is designed with the Markov and absorption properties, then the complete attack graph (AG) proved can be mapped into the AMC. In addition, the probability metric for state transition based on common vulnerability scoring system (CVSS) is designed. Finally, the detailed steps for predicting expected number of visits to attack state and expected number of route lengths are further put forward respectively. Experimental analysis results indicate that our method can quantify the probability distribution of routes with different attack lengths, and calculate the expected number of route lengths. Moreover, it can predict the expected number of atomic attacks needed to compromise the attack goal. The predictions can be used in node threat ranking. Hence, our approach provides more guidance for network security protection in response to network attack threat timely.
  • Related Articles

    [1]Bai Ting, Liu Xuanning, Wu Bin, Zhang Zibin, Xu Zhiyuan, Lin Kangyi. Multi-Granularity Based Feature Interaction Pruning Model for CTR Prediction[J]. Journal of Computer Research and Development, 2024, 61(5): 1290-1298. DOI: 10.7544/issn1000-1239.202220943
    [2]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [3]Li Qi, Zhong Jiang, Li Xue. DyBGP: A Dynamic-Balanced Algorithm for Graph Partitioning Based on Heuristic Strategies[J]. Journal of Computer Research and Development, 2017, 54(12): 2851-2857. DOI: 10.7544/issn1000-1239.2017.20160690
    [4]Sun Li, Li Jing, Liu Guohua. Join Strategy Optimization in Column Storage Based Query[J]. Journal of Computer Research and Development, 2013, 50(8): 1647-1656.
    [5]Bi Xiaojun, Liu Guo'an, Xiao Jing. Dynamic Adaptive Differential Evolution Based on Novel Mutation Strategy[J]. Journal of Computer Research and Development, 2012, 49(6): 1288-1297.
    [6]Gu Wenxiang, Wang Jinyan, Yin Minghao. Knowledge Compilation Using Extension Rule Based on MCN and MO Heuristic Strategies[J]. Journal of Computer Research and Development, 2011, 48(11): 2064-2073.
    [7]Zhou Anfu, Liu Min, and Li Zhongcheng. Study on Optimal Packet Dispersion Strategy[J]. Journal of Computer Research and Development, 2009, 46(4): 541-548.
    [8]Chen Mao, Huang Wenqi. A Heuristic Algorithm for the Unequal Circle Packing Problem[J]. Journal of Computer Research and Development, 2007, 44(12): 2092-2097.
    [9]Ding Ding, Luo Siwei, and Gao Zhan. An Object-Adjustable Heuristic Scheduling Strategy in Grid Environments[J]. Journal of Computer Research and Development, 2007, 44(9): 1572-1578.
    [10]Yang Xiaowei, Lu Jie, Zhang Guangquan. An Effective Pruning Algorithm for Least Squares Support Vector Machine Classifier[J]. Journal of Computer Research and Development, 2007, 44(7): 1128-1136.
  • Cited by

    Periodical cited type(8)

    1. 唐旭,张多利,王杰,宋宇鲲. 异构多核处理器多发射动态调度技术研究. 合肥工业大学学报(自然科学版). 2023(05): 632-640 .
    2. 纪元,郑卫波,王梓. 基于容器的安全接入虚拟化. 计算机与现代化. 2022(09): 106-110+118 .
    3. 阳勇,孟相如,康巧燕,韩晓阳. 拓扑与资源感知的虚拟网络功能迁移方法. 计算机科学与探索. 2021(11): 2161-2170 .
    4. 曾理,叶晓舟,王玲芳. DPDK技术应用研究综述. 网络新媒体技术. 2020(02): 1-8 .
    5. 邓理,吴伟楠,朱正一,陈鸣. DiffSec:一种差别性的智能网络安全服务模型. 计算机研究与发展. 2019(05): 955-966 . 本站查看
    6. 房一泉,姚俊,万浩,徐鹏. 教育信息化大平台的构建. 化工高等教育. 2019(03): 38-42+89 .
    7. 李佑文,褚红健,王志心. 基于网络负载均衡的综合监控系统网关设计. 江苏科技信息. 2019(32): 57-59 .
    8. 胡洪云,符小周. 基于网络功能虚拟化的高性能负载均衡研究. 佳木斯职业学院学报. 2018(11): 393-394 .

    Other cited types(4)

Catalog

    Article views (1393) PDF downloads (794) Cited by(12)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return