本文選題：網(wǎng)絡(luò)可生存性 + 策略選取��； 參考：《火力與指揮控制》2017年11期

【摘要】：針對(duì)網(wǎng)絡(luò)攻防環(huán)境中防御方以提高系統(tǒng)生存能力為目的所進(jìn)行的最優(yōu)生存防御策略的選取問(wèn)題,提出了一種基于完全信息動(dòng)態(tài)博弈理論的生存防御策略優(yōu)化配置算法。將惡意攻擊方、故障意外事件及防御方作為博弈的參與人,提出了一種混合戰(zhàn)略模式下的三方動(dòng)態(tài)博弈模型,對(duì)博弈的主要信息要素進(jìn)行了說(shuō)明,以混合戰(zhàn)略納什均衡理論為基礎(chǔ),將原納什均衡條件式的表達(dá)式轉(zhuǎn)化為可計(jì)算數(shù)值結(jié)果的表達(dá)式,并據(jù)此增加了近似的概念,最后,將提出的模型和近似納什均衡求解算法應(yīng)用到一個(gè)網(wǎng)絡(luò)實(shí)例中,結(jié)果證明了模型和算法的可行性和有效性。
[Abstract]:Aiming at the problem of selecting the optimal survival defense strategy of the defense side in the network attack and defense environment in order to improve the survival ability of the system, an optimal configuration algorithm of the survival defense strategy based on the dynamic game theory of complete information is proposed. Taking the malicious attacking side, the fault accident side and the defense side as the participants, a three-party dynamic game model under the mixed strategy mode is proposed, and the main information elements of the game are explained. Based on the mixed strategy Nash equilibrium theory, the expression of the original Nash equilibrium condition is transformed into an expression of computable numerical results, and the approximate concept is added accordingly. The proposed model and approximate Nash equilibrium algorithm are applied to a network example. The results show that the model and algorithm are feasible and effective.
【作者單位】： 解放軍93936部隊(duì);
【分類號(hào)】：TP393.08
，

本文編號(hào)：2065790