Please use this identifier to cite or link to this item:
|Title:||Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network|
Lin, Frank Yeong-Sung
|Abstract:||The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their respective strategies. Given the importance of improving information security, a growing number of researchers are now focusing on how to combine the concepts of network survivability and protection against malicious attacks. As defense resources are limited, we propose effective resource allocation strategies that maximize an attacker's costs and minimize the probability that the "core node" of a network will be compromised, thereby improving its protection. The two problems are analyzed as a mixed, nonlinear, integer programming optimization problem. The solution approach is based on the Lagrangean relaxation method, which solves this complicated problem effectively. We also evaluate the survivability of real networks, such as scale-free networks|
|Relation:||Proceedings of the Second International Conference on Availability, Reliability and Security (ARES'07), IEEE, pp.213-222|
|Appears in Collections:||[資訊管理學系] 會議論文|
Files in This Item:
All items in 學術集成 are protected by copyright, with all rights reserved.