基于马氏链的网络节点重要性评价方法
Evaluation method for node importance in networks based on Markov chain
朱浩 1张玉 1柏诗玉1
作者信息
- 1. 解放军电子工程学院,安徽合肥230037
- 折叠
摘要
针对网络攻击与防御中资源分配时需对网络节点进行重要性评估的问题,提出了基于网络拓扑图的马氏链模型.并指出若网络中存在经过奇数次跳转能够回到自己的节点时,此网络图的马氏链就是遍历的,且其极限概率为该节点的度比上所有节点度之和.然后根据上述模型,提出把其它节点以最短路径到达该节点概率之和作为节点重要性评判指标.最后进行了实验分析,实验证实了所建模型的正确性,以及节点重要性评价算法的准确性.
Abstract
A Markov chain model based on network topography is proposed for evaluating the importance of network nodes in resource allocation of networks attacking and defending.Results illustrate that if there is a node which can come back to itself by odd jumps in the networks,then the Markov chain is ergodic,and the limiting transition probability is the ratio between node's degrees and sum of all nodes' degrees.Then according to the model,sum of the probabilities of all the other nodes reaching the node by the shortest path is regarded as a measure for evaluating the importance of nodes.Lastly some experiments are conducted to show the validity of the model and the accurateness of the method for evaluating node importance.
关键词
通信网/重要性/马氏链/遍历性Key words
communication networks/importance/Markov/ergodicity引用本文复制引用
出版年
2013
NETL
NSTL
维普
万方数据