Maximization of network survivability considering degree of disconnectivity

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages667-676
Number of pages10
Volume6782 LNCS
EditionPART 1
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 International Conference on Computational Science and Its Applications, ICCSA 2011 - Santander, Spain
Duration: Jun 20 2011Jun 23 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6782 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2011 International Conference on Computational Science and Its Applications, ICCSA 2011
CountrySpain
CitySantander
Period6/20/116/23/11

Fingerprint

Network Survivability
Mathematical operators
Survivability
Mathematical programming
Lagrangean Relaxation
Metric
Operator
Mathematical Programming
Attack
Robustness
Evaluate
Vertex of a graph

Keywords

  • Degree of Disconnectivity
  • Information System Survivability
  • Lagrangean Relaxation
  • Mathematical Programming
  • Network Attack
  • Optimization Problem
  • Resource Allocation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yeong-Sung Lin, F., Yen, H. H., & Chen, P. (2011). Maximization of network survivability considering degree of disconnectivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 1 ed., Vol. 6782 LNCS, pp. 667-676). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6782 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-21928-3_49

Maximization of network survivability considering degree of disconnectivity. / Yeong-Sung Lin, Frank; Yen, Hong Hsu; Chen, Pei-yu.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6782 LNCS PART 1. ed. 2011. p. 667-676 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6782 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yeong-Sung Lin, F, Yen, HH & Chen, P 2011, Maximization of network survivability considering degree of disconnectivity. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 edn, vol. 6782 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6782 LNCS, pp. 667-676, 2011 International Conference on Computational Science and Its Applications, ICCSA 2011, Santander, Spain, 6/20/11. https://doi.org/10.1007/978-3-642-21928-3_49
Yeong-Sung Lin F, Yen HH, Chen P. Maximization of network survivability considering degree of disconnectivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 ed. Vol. 6782 LNCS. 2011. p. 667-676. (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-21928-3_49
Yeong-Sung Lin, Frank ; Yen, Hong Hsu ; Chen, Pei-yu. / Maximization of network survivability considering degree of disconnectivity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6782 LNCS PART 1. ed. 2011. pp. 667-676 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{8cd0a51a572e4c028d0c65a318efbd8c,
title = "Maximization of network survivability considering degree of disconnectivity",
abstract = "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.",
keywords = "Degree of Disconnectivity, Information System Survivability, Lagrangean Relaxation, Mathematical Programming, Network Attack, Optimization Problem, Resource Allocation",
author = "{Yeong-Sung Lin}, Frank and Yen, {Hong Hsu} and Pei-yu Chen",
year = "2011",
doi = "10.1007/978-3-642-21928-3_49",
language = "English (US)",
isbn = "9783642219276",
volume = "6782 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "667--676",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 1",

}

TY - GEN

T1 - Maximization of network survivability considering degree of disconnectivity

AU - Yeong-Sung Lin, Frank

AU - Yen, Hong Hsu

AU - Chen, Pei-yu

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

SN - 9783642219276

VL - 6782 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 667

EP - 676

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -