An Evaluation of Network Survivability under the Effect of Accumulated Experience from Sophisticated Attackers

  • Pei-Yu Chen
  • Frank Yeong-Sung Lin
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 309)


This paper is focused on the resource allocation of network attack and defense with mathematical programming and to optimize the problem. It adopts a concept, discount coupon, to describe the attack behavior of taking advantage of accumulated experience from his previous attack actions of minimizing future attack cost. The attacker obtains free experience before he launch an attack or from a compromised node which could further reduce the cost of an attack. The attacker’s objective is to minimize the total attack cost, while the core node is compromised and the network could not survive. Here, by transforming with node splitting into a generalized shortest path problem and applying the algorithm to optimally solve it.


Internet Security Attack Behavior Accumulated Experience Network Survivability Resource Allocation Node Splitting Generalized Shortest Path Problem Optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    McAfee, Advanced Persistent Threats, McAfee (2010)Google Scholar
  2. 2.
    Dacier, M., Pouget, F., Debar, H.: Attack Processes Found on the Internet. In: NATO Symposium IST-041/RSY-013, Toulouse, France (April 2004)Google Scholar
  3. 3.
    Bhuyan, M.H., Bhattacharyya, D.K., Kalita, J.K.: Surveying Port Scans and Their Detection Methodologies. The Computer Journal 54, 1565–1581 (2011)CrossRefGoogle Scholar
  4. 4.
    Nicol, D.M., Sanders, W.H., Trivedi, K.S.: Model-based Evaluation: From Dependability to Security. IEEE Transactions on Dependable and Secure Computing 1(1), 48–65 (2004)CrossRefGoogle Scholar
  5. 5.
    McDermott, J.: Attack-Potential-Based Survivability Modeling for High-Consequence Systems. In: Proceedings of the 3rd IEEE International Workshop on Information Assurance, pp. 119–130 (March 2005)Google Scholar
  6. 6.
    Ortalo, R., Deswarte, Y., Kaaniche, M.: Experiments with Quantitative Evaluation Tools for Monitoring Operational Security. IEEE Transactions on Software Engineering 25(5), 633–650 (1999)CrossRefGoogle Scholar
  7. 7.
    Ellison, R.J., Fisher, D.A., Linger, R.C., Lipson, H.F., Longstaff, T.A., Mead, N.R.: Survivable Network Systems: An Emerging Discipline, Technical Report CMU/SEI-97-TR-013, Software Engineering Institute, Carnegie Mellon University (1997)Google Scholar
  8. 8.
    Ahuja, R.K., MAgnagti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993) ISBN 978-0136175490Google Scholar
  9. 9.
    Batagelj, V., Brandenburg, F.J., Mendez, P.O.D., Sen, A.: The Generalized Shortest Path Problem, The Pennsylvania State University (July 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Information ManagementNational Taiwan UniversityTaipeiTaiwan, R.O.C
  2. 2.Institute for Information IndustryTaipeiTaiwan, R.O.C.

Personalised recommendations