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

6 Scopus citations

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
Edition	PART 1
ISBN (Print)	9783642212185
DOIs	https://doi.org/10.1007/978-3-642-21219-2_8
State	Published - 2011
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	6678 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

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

Cite this

Lin, F. Y. S., Yen, H. H., Chen, P. Y., & Wen, Y. F. (2011). Evaluation of network survivability considering degree of disconnectivity. In Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings (PART 1 ed., pp. 51-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6678 LNAI, No. PART 1). 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. PART 1. ed. 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, No. PART 1).

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

Lin, FYS, Yen, HH, Chen, PY & Wen, YF 2011, Evaluation of network survivability considering degree of disconnectivity. in Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6678 LNAI, Springer Verlag, pp. 51-58. https://doi.org/10.1007/978-3-642-21219-2_8

Lin FYS, Yen HH, Chen PY, Wen YF. Evaluation of network survivability considering degree of disconnectivity. In Hybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings. PART 1 ed. Springer Verlag. 2011. p. 51-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). 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. PART 1. ed. Springer Verlag, 2011. pp. 51-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@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 Chen, {Pei Yu} and Wen, {Ya Fang}",

note = "Funding Information: In this paper, we adopt a DOD metric in the computational experiments. The current research considers two attack strategies under given topology, but it would be more comprehensive if attacker behavior is more vivid. If the attacker{\textquoteright}s apparent objective is to compromise a network, he will try his best to damage the target Acknowledgments. This research was supported by the National Science Council of Taiwan, Republic of China, under grant NSC-99-2221-E-002-132.",

year = "2011",

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

language = "English (US)",

isbn = "9783642212185",

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

publisher = "Springer Verlag",

number = "PART 1",

pages = "51--58",

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

edition = "PART 1",

}

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

N1 - Funding Information: In this paper, we adopt a DOD metric in the computational experiments. The current research considers two attack strategies under given topology, but it would be more comprehensive if attacker behavior is more vivid. If the attacker’s apparent objective is to compromise a network, he will try his best to damage the target 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 - 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

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 -

Evaluation of network survivability considering degree of disconnectivity

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this