TY - GEN
T1 - Network defense strategies for maximization of network survivability
AU - Lin, Frank Yeong Sung
AU - Yen, Hong Hsu
AU - Chen, Pei Yu
AU - Wen, Ya Fang
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Degree of Disconnectivity
KW - Information System Survivability
KW - Lagrangean Relaxation
KW - Mathematical Programming
KW - Network Attack and Defense
KW - Optimization
KW - Resource Allocation
UR - http://www.scopus.com/inward/record.url?scp=79960506595&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960506595&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21822-4_14
DO - 10.1007/978-3-642-21822-4_14
M3 - Conference contribution
AN - SCOPUS:79960506595
SN - 9783642218217
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 125
EP - 134
BT - Modern Approaches in Applied Intelligence - 24th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2011, Proceedings
T2 - 24th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2011
Y2 - 28 June 2011 through 1 July 2011
ER -