Name
Abstract | ||
|---|---|---|
The paper considers strategic defense and attack of a system which can be separated into independent identical homogeneous parallel elements. The defender distributes its resource between separation of the elements and their protection from outside attacks. The attacker distributes its effort evenly among all attacked elements. The vulnerability of each element is determined by a contest success function between the attacker and the defender. The defender can choose a subset of the elements to defend. The attacker does not know which elements are protected and can choose a number of randomly chosen elements to attack. Separation efficiency conditions are formulated dependent on the defender’s and attacker’s budgets, separation costs, contest intensity, and system demand. An algorithm for determining the optimal number of protected elements is suggested for the case when both the defender and the attacker can choose the number of protected and attacked elements freely. The article considers both the cases without and with performance redundancy. Illustrative numerical examples are presented. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejor.2009.08.016 | European Journal of Operational Research |
Keywords | Field | DocType |
Survivability,Vulnerability,Reliability,Defense,Attack,Protection,Separation,Game theory | Mathematical optimization,Survivability,Strategic defence,Computer security,Homogeneous,CONTEST,Fault tolerance,Redundancy (engineering),Game theory,Mathematics | Journal |
Volume | Issue | ISSN |
203 | 3 | 0377-2217 |
Citations | PageRank | References |
9 | 0.60 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gregory Levitin | 1 | 1422 | 115.34 |
| Kjell Hausken | 2 | 537 | 46.28 |