Skip to main content

Maximization of Network Survivability Considering Degree of Disconnectivity

  • Conference paper
Computational Science and Its Applications - ICCSA 2011 (ICCSA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6782))

Included in the following conference series:

  • 2147 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Snow, A.P., Varshney, U., Malloy, A.D.: Reliability and Survivability of Wireless and Mobile Networks. IEEE Computer 33(7), 449–454 (2000)

    Article  Google Scholar 

  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. Westmark, V.R.: A Definition for Information System Survivability. In: Proceedings of the 37th Hawaii International Conference on System Sciences (2004)

    Google Scholar 

  4. Al-Kofahi, O.M., Kamal, A.E.: Survivability Strategies in Multihop Wireless Networks. IEEE Wireless Communications (2010)

    Google Scholar 

  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)

    Article  Google Scholar 

  6. Powell, R.: Defending Against Terrorist Attacks with Limited Resources. American Political Science Review 101(3), 527–541 (2007)

    Article  Google Scholar 

  7. Fisher, M.L.: An Applications Oriented Guide to Lagrangian Relaxation. Interfaces 15(2), 10–21 (1985)

    Article  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yeong-Sung Lin, F., Yen, HH., Chen, PY. (2011). Maximization of Network Survivability Considering Degree of Disconnectivity. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21928-3_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21928-3_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21927-6

  • Online ISBN: 978-3-642-21928-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics