Maximization of network survivability considering degree of disconnectivity

  • Authors:
  • Frank Yeong-Sung Lin;Hong-Hsu Yen;Pei-Yu Chen

  • Affiliations:
  • Department of Information Management, National Taiwan University;Department of Information Management, Shih Hsin University;Department of Information Management, National Taiwan University and Information and Communication Security Technology Center, Taipei, Taiwan, R.O.C. and Institute Information Industry Taipei, Tai ...

  • Venue:
  • ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.