Evaluation of Network Survivability Considering Degree of Disconnectivity

Frank Yeong Sung Lin; Hong Hsu Yen; Pei-yu Chen; Ya Fang Wen

doi:10.1007/978-3-642-21219-2_8

Evaluation of Network Survivability Considering Degree of Disconnectivity

Frank Yeong Sung Lin, Hong Hsu Yen, Pei-yu Chen, Ya Fang Wen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	https://doi.org/10.1007/978-3-642-21219-2_8
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

Keywords

Degree of Disconnectivity
Lagrangean Relaxation
Network Attack
Optimization Problem
Resource Allocation

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-21219-2_8

Fingerprint Dive into the research topics of 'Evaluation of Network Survivability Considering Degree of Disconnectivity'. Together they form a unique fingerprint.

Cite this

Lin, F. Y. S., Yen, H. H., Chen, P., & Wen, Y. F. (2011). Evaluation of Network Survivability Considering Degree of Disconnectivity. In Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings (Vol. 6678 LNAI, pp. 51-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6678 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-642-21219-2_8

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

Lin, FYS, Yen, HH, Chen, P & Wen, YF 2011, Evaluation of Network Survivability Considering Degree of Disconnectivity. in Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings. vol. 6678 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6678 LNAI, Springer Verlag, pp. 51-58, 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011, Wroclaw, Poland, 5/23/11. https://doi.org/10.1007/978-3-642-21219-2_8

Lin FYS, Yen HH, Chen P, Wen YF. Evaluation of Network Survivability Considering Degree of Disconnectivity. In 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)). https://doi.org/10.1007/978-3-642-21219-2_8

Lin, Frank Yeong Sung ; Yen, Hong Hsu ; Chen, Pei-yu ; Wen, Ya Fang. / Evaluation of Network Survivability Considering Degree of Disconnectivity. Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings. Vol. 6678 LNAI Springer Verlag, 2011. pp. 51-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6c3214d2bb5c4d56a4e8e65e3b8a74bb,

title = "Evaluation of Network Survivability Considering Degree of Disconnectivity",

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.",

keywords = "Degree of Disconnectivity, Lagrangean Relaxation, Network Attack, Optimization Problem, Resource Allocation",

author = "Lin, {Frank Yeong Sung} and Yen, {Hong Hsu} and Pei-yu Chen and Wen, {Ya Fang}",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/978-3-642-21219-2_8",

language = "English (US)",

isbn = "9783642212185",

volume = "6678 LNAI",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "51--58",

booktitle = "Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings",

address = "Germany",

note = "6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011 ; Conference date: 23-05-2011 Through 25-05-2011",

}

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

AN - SCOPUS:85038004572

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

T2 - 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011

Y2 - 23 May 2011 through 25 May 2011

ER -