https://scholars.lib.ntu.edu.tw/handle/123456789/105302
標題: | A Near-Optimal Redundancy Allocation Strategy that Minimizes a System’s Vulnerability to Hazardous Events and Malicious Attacks | 作者: | Lin, F.Y.S. Tsang, P.H. YEONG-SUNG LIN |
公開日期: | 2008 | 起(迄)頁: | 411-416 | 來源出版物: | CISU_U08 | 摘要: | 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. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/244695 | DOI: | 10.1109/CIS.2008.142 | SDG/關鍵字: | 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 |
顯示於: | 資訊管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。