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 proceedingConference contribution

6 Scopus citations


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 languageEnglish (US)
Title of host publicationHybrid Artificial Intelligent Systems - 6th International Conference, HAIS 2011, Proceedings
PublisherSpringer Verlag
Number of pages8
EditionPART 1
ISBN (Print)9783642212185
StatePublished - 2011
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6678 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Degree of Disconnectivity
  • Lagrangean Relaxation
  • Network Attack
  • Optimization Problem
  • Resource Allocation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Evaluation of network survivability considering degree of disconnectivity'. Together they form a unique fingerprint.

Cite this