基于马氏链的数据链网络抗毁性评价方法

Evaluation Method for Networks Invulnerability Based on Markov Chain

针对数据链网络抗摧毁问题,提出了基于网络拓扑图的马氏链模型。指出若网络中存在经过奇数次跳转能够回到自己的节点时,此网络图的马氏链是遍历的,且其极限概率为该节点的度比上所有节点度之和。然后根据上述模型,提出把其他节点以最短路径到达该节点概率之和作为节点重要性评判指标。在此基础上,把待评价网络与全联通网络的进行结构差异比较作为抗毁性的评价方法。实例验证了模型与算法的有效性。

A Markov chain model based on the topography of networks is proposed for evaluating data link networks invulnerability. Results show if there is a node which can come back to itself by odd jumps in the networks, 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 probabilities of all the other nodes reaching the node by shortest path is regarded as a measure for evaluating the importance of nodes. Lastly, comparing the topology differences between target： networks and full-connecting networks is regarded as a method for evaluation networks invulnerability. The examples verify the efficiency of the model and method.