考慮單一核心節點攻擊下 網路近似最佳化防護策略

Abstract

隨著近年來網路科技的蓬勃發展，網際網路已成為21世紀最重要的傳播媒體，伴隨而來，資訊安全的議題也越形重要。我們發現，在網路攻防下，攻防雙方都會依據對方的策略而改變自己的對策，就如矛與盾一般地相互抗衡。 在本篇論文中，我們以防守方的角度來思考，在有限的防禦資源限制下，提出一個有效的防禦資源配置策略，來最大化攻擊者的攻擊成本，以提高核心節點的防護能力。分析此問題，為一非線性混合整數規劃的數學最佳化問題，由於問題本身高度的複雜性與困難度，所以我們以格拉蘭日鬆弛法為基礎的演算法來處理此問題，並針對與真實網路環境相似之無尺度網路，進行其存活度分析與探討。

With the rapid growth of network technologies, the Internet may well become the single most important medium of the 21st century. Therefore, the issue of information security has drawn increasing attention. In network attack and defense, attackers and defenders constantly change their respective strategies. The situation is like the balance between a lance and a targe. In this thesis, we view the problem of security from the defender’s perspective. Given that defense resources are limited, we propose an effective defense resource allocation strategy that maximizes the attackers’ costs, and improves the protection of the core node. The problem is analyzed as a mixed nonlinear integer programming optimization problem. The solution approach is based on the Lagrangean relaxation method, which effectively solves this complicated problem. Furthermore, we evaluate the survivability of real network environment-like scale-free networks.