Abstract
It is impossible for a system or network to keep completely safe with the possibility of many new threats occurring at any moment. To analyze and solve these kinds of problems, this paper presents a mathematical programming problem, which adopts a novel metric called Degree of Disconnectivity (DOD) to evaluate the damage level and survivability of a network. To evaluate and analyze the robustness of a network for network operators, this problem is modeled as a mathematical programming problem. Here, an attacker applies his limited attack power intelligently to the targeted network. The objective of the attacker is to compromise nodes, resulting in disconnections of O-D pairs, to ensure that the proposed degree of disconnectivity metric reachs a given level. A Lagrangean relaxation-based algorithm is adopted to solve the proposed problem.
| Original language | English (US) |
|---|---|
| Title of host publication | Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings |
| Publisher | Springer Verlag |
| Pages | 51-58 |
| Number of pages | 8 |
| Volume | 6678 LNAI |
| ISBN (Print) | 9783642212185 |
| DOIs | |
| State | Published - Jan 1 2011 |
| Externally published | Yes |
| Event | 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011 - Wroclaw, Poland Duration: May 23 2011 → May 25 2011 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 6678 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011 |
|---|---|
| Country | Poland |
| City | Wroclaw |
| Period | 5/23/11 → 5/25/11 |
Fingerprint
Keywords
- Degree of Disconnectivity
- Lagrangean Relaxation
- Network Attack
- Optimization Problem
- Resource Allocation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Evaluation of Network Survivability Considering Degree of Disconnectivity. / Lin, Frank Yeong Sung; Yen, Hong Hsu; Chen, Pei-yu; Wen, Ya Fang.
Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings. Vol. 6678 LNAI Springer Verlag, 2011. p. 51-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6678 LNAI).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Evaluation of Network Survivability Considering Degree of Disconnectivity
AU - Lin, Frank Yeong Sung
AU - Yen, Hong Hsu
AU - Chen, Pei-yu
AU - Wen, Ya Fang
PY - 2011/1/1
Y1 - 2011/1/1
N2 - It is impossible for a system or network to keep completely safe with the possibility of many new threats occurring at any moment. To analyze and solve these kinds of problems, this paper presents a mathematical programming problem, which adopts a novel metric called Degree of Disconnectivity (DOD) to evaluate the damage level and survivability of a network. To evaluate and analyze the robustness of a network for network operators, this problem is modeled as a mathematical programming problem. Here, an attacker applies his limited attack power intelligently to the targeted network. The objective of the attacker is to compromise nodes, resulting in disconnections of O-D pairs, to ensure that the proposed degree of disconnectivity metric reachs a given level. A Lagrangean relaxation-based algorithm is adopted to solve the proposed problem.
AB - It is impossible for a system or network to keep completely safe with the possibility of many new threats occurring at any moment. To analyze and solve these kinds of problems, this paper presents a mathematical programming problem, which adopts a novel metric called Degree of Disconnectivity (DOD) to evaluate the damage level and survivability of a network. To evaluate and analyze the robustness of a network for network operators, this problem is modeled as a mathematical programming problem. Here, an attacker applies his limited attack power intelligently to the targeted network. The objective of the attacker is to compromise nodes, resulting in disconnections of O-D pairs, to ensure that the proposed degree of disconnectivity metric reachs a given level. A Lagrangean relaxation-based algorithm is adopted to solve the proposed problem.
KW - Degree of Disconnectivity
KW - Lagrangean Relaxation
KW - Network Attack
KW - Optimization Problem
KW - Resource Allocation
UR - http://www.scopus.com/inward/record.url?scp=85038004572&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038004572&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21219-2_8
DO - 10.1007/978-3-642-21219-2_8
M3 - Conference contribution
SN - 9783642212185
VL - 6678 LNAI
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 51
EP - 58
BT - Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings
PB - Springer Verlag
ER -