TY - GEN
T1 - Maximization of network survivability considering degree of disconnectivity
AU - Yeong-Sung Lin, Frank
AU - Yen, Hong Hsu
AU - Chen, Pei Yu
N1 - Funding Information:
Acknowledgments. This research was supported by the National Science Council of Taiwan, Republic of China, under grant NSC-99-2221-E-002-132.
PY - 2011
Y1 - 2011
N2 - The issues of survivability of networks, especially to some open year round services have increased rapidly over the last few years. To address this topic, the effective survivability metric is mandatory for managerial responsibility. In this paper, we provide a survivability mechanism called Degree of Disconnectivity (DOD) for the network operator to detect risks. To evaluate and analyze the robustness of a network for network operators, this problem is modeled as a mathematical programming problem. An attacker applies his limited attack power intelligently to the targeted network. The objective of the attacker is to compromise nodes, which means to disable the connections of O-D pairs, to achieve the goal of reaching a given level of the proposed Degree of Disconnectivity metric. A Lagrangean Relaxation-based algorithm is adopted to solve the proposed problem.
AB - The issues of survivability of networks, especially to some open year round services have increased rapidly over the last few years. To address this topic, the effective survivability metric is mandatory for managerial responsibility. In this paper, we provide a survivability mechanism called Degree of Disconnectivity (DOD) for the network operator to detect risks. To evaluate and analyze the robustness of a network for network operators, this problem is modeled as a mathematical programming problem. An attacker applies his limited attack power intelligently to the targeted network. The objective of the attacker is to compromise nodes, which means to disable the connections of O-D pairs, to achieve the goal of reaching a given level of the proposed Degree of Disconnectivity metric. A Lagrangean Relaxation-based algorithm is adopted to solve the proposed problem.
KW - Degree of Disconnectivity
KW - Information System Survivability
KW - Lagrangean Relaxation
KW - Mathematical Programming
KW - Network Attack
KW - Optimization Problem
KW - Resource Allocation
UR - http://www.scopus.com/inward/record.url?scp=79960290759&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960290759&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21928-3_49
DO - 10.1007/978-3-642-21928-3_49
M3 - Conference contribution
AN - SCOPUS:79960290759
SN - 9783642219276
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 667
EP - 676
BT - Computational Science and Its Applications, ICCSA 2011 - International Conference, Proceedings
T2 - 2011 International Conference on Computational Science and Its Applications, ICCSA 2011
Y2 - 20 June 2011 through 23 June 2011
ER -