Abstract
The Internet has brought about several threats of information security to individuals and cooperates. It is difficult to keep a network completely safe because cyber attackers can launch attacks through networks without limitations of time and space. As a result, it is an important and critical issue be able to efficiently evaluate network survivability. In this paper, an innovative metric called the Degree of Disconnectivity (DOD) is proposed, which is used to evaluate the damage level of the network. A network attack-defense scenario is also considered in this problem, in which the attack and defense actions are composed by many rounds with each round containing two stages. In the first stage, defenders deploy limited resources on the nodes resulting in attackers needing to increase attack costs to compromise the nodes. In the second stage, the attacker uses his limited budget to launch attacks, trying to maximize the damage of the network. The Lagrangean Relaxation Method is applied to obtain optimal solutions for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Symantec.: Symantec Global Internet Security Threat Report Trends for 2009, Symantec Corporation, vol. XV (April 2010)
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)
Jiang, W., Fang, B.X., Zhang, H.L., Tian, Z.H.: A Game Theoretic Method for Decision and Analysis of the Optimal Active Defense Strategy. In: The International Conference on Computational Intelligence and Security, pp. 819–823 (2007)
Lin, F.Y.S., Tsang, P.H., Chen, P.Y., Chen, H.T.: Maximization of Network Robustness Considering the Effect of Escalation and Accumulated Experience of Intelligent Attackers. In: The 15th World Multi-Conference on Systemics, Cybernetics and Informatics (July 2009)
Lin, F.Y.S., Yen, H.H., Chen, P.Y., Wen, Y.F.: An Evaluation of Network Survivability Considering Degree of Disconnectivity. In: The 6th International Conference on Hybrid Artificial Intelligence Systems (May 2011)
Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27(1), 1–18 (1981)
Geoffrion, M.: Lagrangean Relaxation and its Use in Integer Programming. Mathematical Programming Study 2, 82–114 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, F.YS., Yen, HH., Chen, PY., Wen, YF. (2011). Network Defense Strategies for Maximization of Network Survivability. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21822-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-21822-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21821-7
Online ISBN: 978-3-642-21822-4
eBook Packages: Computer ScienceComputer Science (R0)