一种复杂网络中节点安全重要性排序的度量方法

张子超; 郝蔚琳; 张伊凡

引用本文：

张子超,郝蔚琳,张伊凡.一种复杂网络中节点安全重要性排序的度量方法[J].信息安全学报,2019,4(1):79-88 [点击复制]
ZHANG Zichao,HAO Weilin,ZHANG Yifan.A measure approach for ranking the security importance of node security importance in complex network[J].Journal of Cyber Security,2019,4(1):79-88 [点击复制]

本文已被：浏览 7332次下载 9306次	码上扫一扫！
一种复杂网络中节点安全重要性排序的度量方法
张子超^1,2, 郝蔚琳^1,2, 张伊凡^1,2
0 字体:加大+\|默认\|缩小-
(1.北京大学信息科学技术学院北京 100871;2.高可信软件技术教育部重点实验室北京 100871)

摘要:

近年来,网络空间安全成为信息安全中的热门领域之一,随着复杂网络的研究日渐深入,网络空间安全与复杂网络的结合也变得日益密切。网络的整体安全性依赖于网络中具体节点的安全性,因此,对网络节点的安全重要程度进行有效排序变得极为关键,良好的排序方法应当将越重要的节点排在越靠前的位置。本文从网络的拓扑结构入手,研究了网络节点的局部关键性,在传统基础上考虑了相邻节点及次相邻节点的拓扑结构影响。同时,由于传统方法很少引入动态因素,因此本文引入了网络节点实时流量向量,算法既包含网络拓扑结构,又使用了不同时刻的节点流量,采用了静态与动态相结合的方式。实验结果表明,在破坏排序结果前top-n个节点时,与传统方法相比,本文算法在排序结果上具有更好的效果。

关键词: 网络空间安全复杂网络节点重要性

DOI：10.19363/J.cnki.cn10-1380/tn.2019.01.07

投稿时间：2018-09-30修订日期：2018-12-02

基金项目:本课题得到国家重点研发计划“网络系统安全度量方法与指标体系”项目（No.2016YFB0800700）资助

A measure approach for ranking the security importance of node security importance in complex network

ZHANG Zichao^1,2, HAO Weilin^1,2, ZHANG Yifan^1,2

(1.School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China;2.Key Lab of High Confidence Software Technologies(Peking University), Ministry of Education, Beijing 100871, China)

Abstract:

In recent years, cyber security has become one of the hot fields in information security. With the deepening of research on complex networks, the association of network space security and complex networks has become increasingly close. The overall security of the network depends on the security of specific nodes in the network. Therefore, it is crucial to effectively rank the security importance of network nodes. A good ranking method should rank the more important nodes higher. This paper starts with the topology structure of the network and studies the local key information of the nearest nodes and next nearest nodes. At the same time, because traditional methods lack dynamic factors, real-time flow vector of network nodes is introduced in this paper. The algorithm not only contains network topology, but also node flow at different time points, adopting the combination of static and dynamic factors. Experimental results show that, compared with traditional methods, the algorithm presented in this paper has a better effect on ranking results when top-n nodes are destroyed.

Key words: Cyber Security complex network node importance