### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | Lecture Notes in Electrical Engineering |

Publisher | Springer Verlag |

Pages | 681-687 |

Number of pages | 7 |

Volume | 309 LNEE |

ISBN (Print) | 9783642550379 |

DOIs | |

State | Published - 2014 |

Externally published | Yes |

Event | 9th FTRA InternationalConference on Future Information Technology, FutureTech 2014 - Zhangjiajie, China Duration: May 28 2014 → May 31 2014 |

### Publication series

Name | Lecture Notes in Electrical Engineering |
---|---|

Volume | 309 LNEE |

ISSN (Print) | 18761100 |

ISSN (Electronic) | 18761119 |

### Other

Other | 9th FTRA InternationalConference on Future Information Technology, FutureTech 2014 |
---|---|

Country | China |

City | Zhangjiajie |

Period | 5/28/14 → 5/31/14 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Industrial and Manufacturing Engineering

### Cite this

*Lecture Notes in Electrical Engineering*(Vol. 309 LNEE, pp. 681-687). (Lecture Notes in Electrical Engineering; Vol. 309 LNEE). Springer Verlag. https://doi.org/10.1007/978-3-642-55038-6_106

**An evaluation of network survivability under the effect of accumulated experience from sophisticated attackers.** / Chen, Pei-yu; Lin, Frank Yeong Sung.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Electrical Engineering.*vol. 309 LNEE, Lecture Notes in Electrical Engineering, vol. 309 LNEE, Springer Verlag, pp. 681-687, 9th FTRA InternationalConference on Future Information Technology, FutureTech 2014, Zhangjiajie, China, 5/28/14. https://doi.org/10.1007/978-3-642-55038-6_106

}

TY - GEN

T1 - An evaluation of network survivability under the effect of accumulated experience from sophisticated attackers

AU - Chen, Pei-yu

AU - Lin, Frank Yeong Sung

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Accumulated Experience

KW - Attack Behavior

KW - Generalized Shortest Path Problem

KW - Internet Security

KW - Network Survivability

KW - Node Splitting

KW - Optimization

KW - Resource Allocation

UR - http://www.scopus.com/inward/record.url?scp=84902379936&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902379936&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-55038-6_106

DO - 10.1007/978-3-642-55038-6_106

M3 - Conference contribution

AN - SCOPUS:84902379936

SN - 9783642550379

VL - 309 LNEE

T3 - Lecture Notes in Electrical Engineering

SP - 681

EP - 687

BT - Lecture Notes in Electrical Engineering

PB - Springer Verlag

ER -