Advisor: Yeong-Sung Lin Presented by Chi-Hsiang Chan

Slides:



Advertisements
Similar presentations
Estimation of Means and Proportions
Advertisements

Optimal redundancy allocation for information technology disaster recovery in the network economy Benjamin B.M. Shao IEEE Transaction on Dependable and.
Game-Theoretic Approaches to Critical Infrastructure Protection Workshop on Statistics and Counterterrorism November 20, 2004 Vicki Bier University of.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/3/07 Defending simple series and parallel systems with imperfect false targets R. Peng, G. Levitin,
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/10/25 1 Research Direction Introduction.
Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi-Cin Lin Advisor:
Defending Complex System Against External Impacts Gregory Levitin (IEC, UESTC)
Who and How And How to Mess It up
Sampling.
Unintentional vs. intentional impacts No impact strategy Attacker’s strategy maximizing the expected damage.
Ensemble Learning: An Introduction
Optimal Survivability Enhancement in Complex Vulnerable systems Gregory Levitin The Israel Electric Corporation Ltd.
Reliability-Redundancy Allocation for Multi-State Series-Parallel Systems Zhigang Tian, Ming J. Zuo, and Hongzhong Huang IEEE Transactions on Reliability,
Introduction Many decision making problems in real life
Generalized Minimum Bias Models
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
Chapter 8 Charles P. Jones, Investments: Analysis and Management, Eleventh Edition, John Wiley & Sons 8- 1.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
Advisor: Yeong-Sung Lin Presented by Chi-Hsiang Chan 2011/3/281.
Protection vs. false targets in series systems Reliability Engineering and System Safety(2009) Kjell Hausken, Gregory Levitin Advisor: Frank,Yeong-Sung.
Optimal Voting Strategy Against Rational Attackers th International Conference on Risks and Security of Internet and Systems (CRiSIS) Presenter:
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
BLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio CS 466 Saurabh Sinha.
Adviser: Frank, Yeong - Sung Lin Present by Jason Chang 1.
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
Optimal Resource Allocation for Protecting System Availability against Random Cyber Attack International Conference Computer Research and Development(ICCRD),
Author: Tadeusz Sawik Decision Support Systems Volume 55, Issue 1, April 2013, Pages 156–164 Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
REDUNDANCY VS. PROTECTION VS. FALSE TARGETS FOR SYSTEMS UNDER ATTACK Gregory Levitin, Senior Member, IEEE, and Kjell Hausken IEEE Transactions on Reliability.
Tunable QoS-Aware Network Survivability Presenter : Yen Fen Kao Advisor : Yeong Sung Lin 2013 Proceedings IEEE INFOCOM.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih Defending against multiple different attackers Kjell Hausken, Vicki M. Bier 2011/3/14 1.
Resource Distribution in Multiple Attacks Against a Single Target Author: Gregory Levitin,Kjell Hausken Risk Analysis, Vol. 30, No. 8, 2010.
Advisor: Frank,Yeong-Sung Lin 碩一 冠廷 1.  1.Introduction  2.The attack model 2.1. Even resource distribution between two attacks 2.2. Uneven resource.
Optimal Network Protection Against Diverse Interdictor Strategies Jose E. Ramirez-Marquez, Claudio M. Rocco, Gregory Levitin Advisor : Professor Frank.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Research Direction Introduction.
F5 Performance Management. 2 Section C: Budgeting Designed to give you knowledge and application of: C1. Objectives C2. Budgetary systems C3. Types of.
O PTIMAL R EPLACEMENT AND P ROTECTION S TRATEGY FOR P ARALLEL S YSTEMS R UI P ENG, G REGORY L EVITIN, M IN X IE AND S ZU H UI N G Adviser: Frank, Yeong-Sung.
1 INVESTMENT ANALYSIS & PORTFOLIO MANAGEMENT Lecture # 35 Shahid A. Zia Dr. Shahid A. Zia.
Copyright © Cengage Learning. All rights reserved. 3 Discrete Random Variables and Probability Distributions.
NUMERICAL ANALYSIS I. Introduction Numerical analysis is concerned with the process by which mathematical problems are solved by the operations.
Ensemble Classifiers.
Expectations of Random Variables, Functions of Random Variables
Virtual University of Pakistan
How Much and On What? Defending and Deterring Strategic Attackers
Financial Risk Management of Insurance Enterprises
ESTIMATION.
12. Principles of Parameter Estimation
Relative Values.
Gauss-Siedel Method.
Chapter 19 Jones, Investments: Analysis and Management
Statistical Data Analysis
LECTURE 10: EXPECTATION MAXIMIZATION (EM)
Financial Risk Management of Insurance Enterprises
Elementary Statistics
Defense and attack of complex and dependent systems
Hidden Markov Models Part 2: Algorithms
Network Optimization Research Laboratory
Numerical Analysis Lecture 16.
CHAPTER 5 THEORY OF PRODUCTION. CHAPTER 5 THEORY OF PRODUCTION.
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Department of Information Management National Taiwan University
Adviser: Frank,Yeong-Sung Lin Present by 瀅如
Statistical Data Analysis
Chapter 24: Capital Investment Decisions
Optimization Techniques
Advisor: Frank,Yeong-Sung Lin 碩一 冠廷
Information Theoretical Analysis of Digital Watermarking
Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan
12. Principles of Parameter Estimation
Optimal defence of single object with imperfect false targets
Presentation transcript:

Advisor: Yeong-Sung Lin Presented by Chi-Hsiang Chan Separation in Homogeneous Systems with Independent Identical Elements G Levitin, K Hausken Advisor: Yeong-Sung Lin Presented by Chi-Hsiang Chan 2018/12/3

Agenda Introduction The Model The defender protects each element equally, no performance redundancy The defender protects a subset of the elements, no performance redundancy The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy Systems with performance redundancy Conclusion 2018/12/3

Introduction 2018/12/3

Introduction Researchers use reliability theory to develop risk-reduction strategies have typically assumed a static threat. Bier and Abhichandani(2002) and Bier et al.(2005) assume that the defender minimizes the success probability and expected damage of an attack. Levitin(2007) determines the expected damage for any distribution of the attacker's and the defender's effort in complex multi-state systems. 2018/12/3

Introduction The September 11, 2001 attack illustrated that major threats today involve strategic attackers. There is a need to proceed beyond earlier research and assume that both the defender and attacker of a system are fully strategic optimizing agents. 2018/12/3

Introduction O’Hanlon(2002) et al. applied game theory to analyze components in isolation. Hausken(2002) for an analysis where one agent defends each component in a system. Kunreuther and Heal(2003) and Hausken(2006) for interdependence between components. Hausken(2008) for defense and attack of series and parallel system. 2018/12/3

Introduction Two main actions available to the defender for reducing the expected risk associated with an attack are separation of system elements and their protection. Separation is a rightfully acknowledged and standard practice for reducing system risk in the face of intentional and non-intentional impacts. The protection is a technical of organizational measure aimed at the reduction of the destruction probability of system elements in the case of attack. 2018/12/3

Introduction There exist two methodological approached in studying the system defense problem. First one develops computational tools and techniques for optimizing any specific system defense based on system structure, resources and features of the threats. The second one considers the simplest models in order to analyze the most universal effects and obtain the general insights. 2018/12/3

Introduction This article considers a simplest homogeneous system which van be separated into independent identical parallel elements. Assumes: Each element can either work with nominal performance or be completely destroyed. The elements are so simple that their structure cannot affect their vulnerability. The sake of simplicity that vulnerability of any elements is the same if as the protection and attack efforts are the same. 2018/12/3

The Model 2018/12/3

Nomenclature R,r attacker’s and defender’s resources T,t attacker’s and defender’s effort per single element m contest intensity s separation cost G cumulative system performance N number of identical separated system elements M number of protected elements v element vulnerability F system demand D expected damage Q number of attacked elements 2018/12/3

The Model The model is a system with total cumulative performance G. The system can be separated into N independent elements with the same functionality having performance G/N each. A single successful attack on the separated system can destroy only one element, and cause system cumulative performance reduction from G to G(N-1)/N. 2018/12/3

The Model The total attacker’s resource is R, the total defender’s resource is r. Defender distributed one’s resource between separation s and protection (r-s). The connection between effort and resource is T=R/N and t=(r-s)/N. The vulnerability of any element is determined by a contest between the defender and the attacker. (1) 2018/12/3

Contest Intensity m m ≥0 is a parameter that expresses the intensity of the contest. A benchmark intermediate value is m=1, where the investment have proportional impact on the vulnerability. 0 < m < 1gives a disproportional advantage of investing less than one’s opponent. m>1 gives a disproportional advantage of investing more effort than one’s opponent. m=0 , vulnerability = 50% m=∞ gives a step function where “ winner-takes-all”. The parameter m is a characteristic of the contest which can be illustrated by the history of warfare. 2018/12/3

The Model Having the vulnerabilities of system elements as functions of the attacker’s and the defender’s efforts both agents can estimate the expected damage D caused by the attack for any possible distribution of these efforts. The defender builds the system over time. The attacker takes it as given when he chooses his attack strategy. Therefore, we have to analyze a two period minmax game where the defender moves first and then the attacker moves. 2018/12/3

The defender protects each element equally, no performance redundancy 2018/12/3

The defender protects each element equally, no performance redundancy No performance redundancy means that any reduction in performance causes damage. The probability that k out of N elements are destroyed by the attacker is The damage caused by destruction is kG/N. The expected damage can be obtained as (2) 2018/12/3

The defender protects each element equally, no performance redundancy Proposition 1. Separation with even allocation of the defender’s effort is not beneficial for the defender. Without separation N=1 and s=0, therefore T=R/N and t=r/N. The expected damage is (3) With separation N>1, s>0 and T=R/N, t=(r-s)/N. (4) 2018/12/3

The defender protects a subset of the elements, no performance redundancy 2018/12/3

The defender protects a subset of the elements, no performance redundancy The defender separates the parallel system into N identical elements, but only M elements are protected. The attacker does not know which elements are protected and attacks all of the elements. The effort per elements of attacker and defender is T=R/N and t=(r-s)/M. We assume that this even allocation of the attacker’s resource is known by the defender. 2018/12/3

The defender protects a subset of the elements, no performance redundancy The vulnerability of each one of M protected elements is (5) The expected damage associated with unprotected elements is (6) The expected damage associated with protected elements is (7) The total expected damage is (8) 2018/12/3

The defender protects a subset of the elements, no performance redundancy The optimal number of protected elements can be obtained from the equation: (9) For m>1 (10) (10) can be rewritten in the form T/t=w(m). M obtained from (10) should be rounded upwards of downwards to the closest integer dependent on which of these two integers gives the lowest D as determined by (8) 2018/12/3

The defender protects a subset of the elements, no performance redundancy Inserting (10) into (8) gives the minimal expected damage (11) where the function u(m) also can be written as g(w(m),m)= 2018/12/3

The defender protects a subset of the elements, no performance redundancy 2018/12/3

The defender protects a subset of the elements, no performance redundancy Proposition 2. When the contest intensity m>1 and rioe n <1, the defender protects M out of N elements as specified by (10). When m≤1, or m>1 and ≥1 the defender protects all N elements and the expected damage D is given by (4) When m ≤1, ∂D/ ∂M is always negative. When ≥1, M obtained from (10)is greater than N. M ≤ N. Inserting M=N into (8) gives(4) 2018/12/3

The defender protects a subset of the elements, no performance redundancy Low contest intensity requires fewer resources. This explains that when m is low, the defender can more easily afford to defend all elements. 2018/12/3

The defender protects a subset of the elements, no performance redundancy When m decrease from 2 to 1, W(m) grows rapidly to infinity which violates the condition <1. For m>1 the separation is beneficial if the expected damage is less than in the case without separation. The condition of the separation efficiency is (12) Which can be written as (13) 2018/12/3

The defender protects a subset of the elements, no performance redundancy From (10) and (11) follow that (14) Rewrite (12) as (15) Which can find out M/N (16) 2018/12/3

The defender protects a subset of the elements, no performance redundancy M/N should not exceed 1 (17) From which (18) The combination of (13) and (18) constitutes the condition of separation efficiency. 2018/12/3

The defender protects a subset of the elements, no performance redundancy If the separation cost is negligible (s<<r) inequality (13) takes the form (19) Proposition 3. If the separation cost is negligible, the separation with protecting a subset of the elements is beneficial when (18) hold non-negative for any m>1. H(r/R,m)=0 when R/r=w(m)= , otherwise, H(r/R,m) > 0 2018/12/3

The defender protects a subset of the elements, no performance redundancy In practice the exact value of the contest intensity is not known. Therefore it would be useful to suggest a practical way to choose M for a certain interval of contest intensities m. Assume that instead of (10)one uses the following equation (20) which replace w(m) = x 2018/12/3

The defender protects a subset of the elements, no performance redundancy Substituting M with N(r-s)x/R in (8) we obtain the expected damage (21) For any m the expected damage obtain for (20) exceeds the expected damage obtain for (10)by (22) 2018/12/3

The defender protects a subset of the elements, no performance redundancy In the interval one has to choose such x that minimizes the maximal increase of the expected damage above the value (23) For 2 ≤m ≤20, x=0.83; for 21 ≤m ≤50, x=0.9. When the contest is highly intensive( m →∞,“winner-takes-all”), x→1 2018/12/3

The defender protects a subset of the elements, no performance redundancy The separation is not beneficial when the contest intensity is low (m<2). For 2 ≤m ≤20, M should be as close as possible to For 21 ≤m ≤50, M should be as close as possible to In the “winner-takes-all” situation(m →∞), M should be as close as possible, but less than 2018/12/3

The defender protects a subset of the elements, no performance redundancy 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy The defender protects M elements, and the attacker attacks Q elements. T=R/Q , t=(r-s)/M The probability that the attacker attacks exactly q protected elements is (24) Vulnerability of each element is (25) 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy The probability that exactly k elements are destroyed out of q protected elements that are attacked is (26) Total destroyed elements s=k+Q-q. The probability of destruction of exactly s elements can be obtained as (27) 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy We can obtain the expected damage caused by the attack as (28) The optimal values of M and Q can be obtained by the following enumerative procedure. 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy 2018/12/3

The defender protects a subset of the elements, the attacker attack a subset of elements, no performance redundancy 2018/12/3

Systems with performance redundancy 2018/12/3

Systems with performance redundancy Assume that the system must meet a demand F<G. If the number of destroyed elements is k, the damage is (29) The expected damage can be obtained as (30) (here we assume that M=N=Q) 2018/12/3

Systems with performance redundancy Without separation the expected damage is vF. The condition of the separation efficiency takes the form (31) or 2018/12/3

Systems with performance redundancy 2018/12/3

Systems with performance redundancy As a special case consider a widely used redundant parallel system(1-out of N)which meets the demand if at least one of its elements survives. This corresponds to the case when 0<F<G/N and α = N in (30). Condition (31) takes the form (33) which gives (34) 2018/12/3

Systems with performance redundancy s* is independent of F when 0<F<G/N =0.1 as determined by (34), and decreases towards zero as F increases above G/N towards G. s* is lower when the contest intensity is high or the attacker’s resource is high. 2018/12/3

Systems with performance redundancy In the general case when both the attacker and the defender choose Q elements to attack and M elements to defend. The expected damage caused by the attack for any demand F as (35) use the procedure remind before to find out the optimal value of M and Q 2018/12/3

Systems with performance redundancy 2018/12/3

Systems with performance redundancy 2018/12/3

Systems with performance redundancy In order to check the sensitivity of separation efficiency to the chosen value of M, we replace the optimal values of M with constants.(fixed M and optimal Q) 2018/12/3

Systems with performance redundancy In order to make the managerial decisions about the number of protected elements when the exact balue of the contest intensity m is not known, one can use the following iterative approach: Obtain the optimal values of m in the supposed range of m using the suggested algorithm. Evaluate the expected damage D*(M) in the given range of m for several fixed values of M The comparison of the obtained results helps in making the decision. 2018/12/3

Systems with performance redundancy 2018/12/3

Conclusion 2018/12/3

Conclusion Systems without performance redundancy separation with even allocation of the defender’s effort among all the elements is not beneficial for the defender. Separation with protecting a subset of the elements, when the attacker attacks all elements, is not beneficial for the defender if the contest intensity m ≤1 The separation efficiency depends on the defender’s and attacker’s budgets, separation costs, contest intensity and system demand. Further research can be devoted to incorporating the inherent values of destroyed elements into the model. 2018/12/3

Thanks for listening 2018/12/3