Maximization of Network Survivability Considering Degree of Disconnectivity

  • Frank Yeong-Sung Lin
  • Hong-Hsu Yen
  • Pei-Yu Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6782)


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.


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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Snow, A.P., Varshney, U., Malloy, A.D.: Reliability and Survivability of Wireless and Mobile Networks. IEEE Computer 33(7), 449–454 (2000)CrossRefGoogle Scholar
  2. 2.
    Ellison, R.J., Fisher, D.A., Linger, R.C., Lipson, H.F., Longstaff, T., Mead, N.R.: Survivable Network Systems: An Emerging Discipline, Technical Report CMU/SEI-97-TR-013 (November 1997)Google Scholar
  3. 3.
    Westmark, V.R.: A Definition for Information System Survivability. In: Proceedings of the 37th Hawaii International Conference on System Sciences (2004)Google Scholar
  4. 4.
    Al-Kofahi, O.M., Kamal, A.E.: Survivability Strategies in Multihop Wireless Networks. IEEE Wireless Communications (2010)Google Scholar
  5. 5.
    Bier, V.M., Oliveros, S., Samuelson, L.: Choosing What to Protect: Strategic Defense Allocation Against an Unknown Attacker. Journal of Public Economic Theory 9, 563–587 (2007)CrossRefGoogle Scholar
  6. 6.
    Powell, R.: Defending Against Terrorist Attacks with Limited Resources. American Political Science Review 101(3), 527–541 (2007)CrossRefGoogle Scholar
  7. 7.
    Fisher, M.L.: An Applications Oriented Guide to Lagrangian Relaxation. Interfaces 15(2), 10–21 (1985)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications: Chapter 16 Lagrangian Relaxation and Network Optimization, pp. 598–639. Prentice-Hall, Englewood Cliffs (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Frank Yeong-Sung Lin
    • 1
  • Hong-Hsu Yen
    • 2
  • Pei-Yu Chen
    • 1
    • 3
    • 4
  1. 1.Department of Information ManagementNational Taiwan UniversityTaiwan
  2. 2.Department of Information ManagementShih Hsin UniversityTaiwan
  3. 3.Information and Communication Security Technology CenterTaipeiTaiwan, R.O.C.
  4. 4.Institute Information Industry TaipeiTaiwan, R.O.C.

Personalised recommendations