A Near-Optimal Redundancy Allocation Strategy that Minimizes a System’s Vulnerability to Hazardous Events and Malicious Attacks
Resource
CISU_U08, 411-416
Journal
CISU_U08
Pages
411-416
Date Issued
2008
Date
2008
Author(s)
Abstract
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to ensure service continuity in the context of risk management, where the ultimate goal is to reduce potential threats to an acceptable level with limited resources. In this paper, we address the problem of reducing the vulnerability of a network to hazardous events and malicious attacks. We analyze the problem as a mixed, nonlinear, integer programming optimization problem with a min-max format. The solution approach, which is based on Lagrangean Relaxation and a subgradient method, solves this complicated problem effectively. We evaluate the scalability and applicability of the proposed heuristic via computational experiments on different network topologies and scales. © 2008 IEEE.
Other Subjects
Best strategies; Computational experiments; Continuous services; Hazardous events; Information infrastructures; Lagrangean relaxations; Malicious attacks; Min maxes; Network topologies; Optimal redundancy allocations; Optimization problems; Or-networks; Potential threats; Redundancy allocations; Service continuities; Solution approaches; Subgradient methods; Artificial intelligence; Computer crime; Electric network topology; Intelligent control; Programming theory; Quality assurance; Redundancy; Reliability; Risk analysis; Risk management; Integer programming
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
26.pdf
Size
23.21 KB
Format
Adobe PDF
Checksum
(MD5):20a75ae36781d9e2c2fe899b6c98c113