Near Optimal Protection Strategies against Targeted Attacks on the Core Node of a Network
Date Issued
2006
Date
2006
Author(s)
Lin, Yi-Luen
DOI
en-US
Abstract
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.
Subjects
防禦資源配置策略
網路攻防
存活度
拉格蘭日鬆弛法
最佳化
無尺度網路
Defense Resource Allocation Strategy
Information Security
Lagrangean Relaxation Method
Network Attack and Defense
Optimization
Scale-Free Networks
Survivability
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93725041-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):606661c7fdc3f82a36732bf1786eb386