https://scholars.lib.ntu.edu.tw/handle/123456789/457494
標題: | Network defense strategies for maximization of network survivability | 作者: | YEONG-SUNG LIN Yen, H.-H Chen, P.-Y Wen, Y.-F. |
公開日期: | 2011 | 卷: | 6703 LNAI | 期: | PART 1 | 起(迄)頁: | 125-134 | 來源出版物: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 摘要: | The Internet has brought about several threats of information security to individuals and cooperates. It is difficult to keep a network completely safe because cyber attackers can launch attacks through networks without limitations of time and space. As a result, it is an important and critical issue be able to efficiently evaluate network survivability. In this paper, an innovative metric called the Degree of Disconnectivity (DOD) is proposed, which is used to evaluate the damage level of the network. A network attack-defense scenario is also considered in this problem, in which the attack and defense actions are composed by many rounds with each round containing two stages. In the first stage, defenders deploy limited resources on the nodes resulting in attackers needing to increase attack costs to compromise the nodes. In the second stage, the attacker uses his limited budget to launch attacks, trying to maximize the damage of the network. The Lagrangean Relaxation Method is applied to obtain optimal solutions for the problem. © 2011 Springer-Verlag. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/457494 | DOI: | 10.1007/978-3-642-21822-4_14 | SDG/關鍵字: | Critical issues; Cyber attackers; Damage level; Disconnectivity; Information System Survivability; Lagrangean Relaxation; Lagrangean relaxation methods; Network Attack and Defense; Network defense; Network survivability; Optimal solutions; Two stage; Industrial engineering; Intelligent systems; Launching; Mathematical programming; Network security; Computer crime |
顯示於: | 資訊管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。