A Near-Optimal Redundancy Allocation Policy to Minimize System Vulnerability against Hazardous Events and Malicious Attacks
Date Issued
2007
Date
2007
Author(s)
Jiang, Kun-Dao
DOI
en-US
Abstract
Modern organizations have increasingly relied on information technology to facilitate daily business operations. However, the dependency is built upon an environment where hazardous events happen frequently and malicious attacks emerge in an endless stream. To attain the objective of “continuity of services”, we propose an approach based on redundancy allocation to reduce the possibility of threats occurring to an acceptable degree.
In the thesis, we formulate a “battle” between the attacker and the network into a two-level programming problem. In the inner problem (ARS model) an attacker allocates the limited attack powers to maximize the vulnerability of network against hazardous events. Contrarily, in the outer problem (RAPMA model) a defender attempts to minimize the damages by deploying redundant components appropriately with the limited budgets. We develop a Lagrangean Relaxation-based algorithm to solve the programming problem efficiently.
Subjects
冗餘配置問題
網路最佳化
數學規劃
資源配置
拉格蘭氏鬆弛法
網路脆弱度
網路存活度
Redundancy Allocation Problem
Network Optimization
Mathematical Programming
Resources Allocation
Lagrangean Relaxation
Network Vulnerability
Network Survivability
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94725018-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):6c43e65544528fa8f5e48042b79f5111