A Framework for Network Survivability Characterization Soung C. Liew and Kevin W. Lu IEEE Journal on Selected Areas in Communications, January 1994 (ICC,

Slides:



Advertisements
Similar presentations
Why this can be happen to me?. Can you think, who’ll be the faster catch the fish??
Advertisements

Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
The Binomial Probability Distribution and Related Topics
Sampling Distributions
Evaluating Hypotheses
CHAPTER 6 Statistical Analysis of Experimental Data
Discrete Probability Distributions
Chapter 2 Simple Comparative Experiments
Continuous Random Variables and Probability Distributions
Inferences About Process Quality
Copyright © Cengage Learning. All rights reserved. 5 Integrals.
McGraw-Hill Ryerson Copyright © 2011 McGraw-Hill Ryerson Limited. Adapted by Peter Au, George Brown College.
Lecture II-2: Probability Review
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
CMPE 252A: Computer Networks Review Set:
INFERENTIAL STATISTICS – Samples are only estimates of the population – Sample statistics will be slightly off from the true values of its population’s.
Pairs of Random Variables Random Process. Introduction  In this lecture you will study:  Joint pmf, cdf, and pdf  Joint moments  The degree of “correlation”
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
L7.1b Continuous Random Variables CONTINUOUS RANDOM VARIABLES NORMAL DISTRIBUTIONS AD PROBABILITY DISTRIBUTIONS.
Random variables Petter Mostad Repetition Sample space, set theory, events, probability Conditional probability, Bayes theorem, independence,
Adviser: Frank, Yeong-Sung Lin Present by Wayne Hsiao.
1 CSI5388: Functional Elements of Statistics for Machine Learning Part I.
1 As we have seen in section 4 conditional probability density functions are useful to update the information about an event based on the knowledge about.
1 Institute of Engineering Mechanics Leopold-Franzens University Innsbruck, Austria, EU H.J. Pradlwarter and G.I. Schuëller Confidence.
1 Performance Analysis of Coexisting Secondary Users in Heterogeneous Cognitive Radio Network Xiaohua Li Dept. of Electrical & Computer Engineering State.
Chapter 10. Sampling Strategy for Building Decision Trees from Very Large Databases Comprising Many Continuous Attributes Jean-Hugues Chauchat and Ricco.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
Utilizing Call Admission Control for Pricing Optimization of Multiple Service Classes in Wireless Cellular Networks Authors : Okan Yilmaz, Ing-Ray Chen.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Biostatistics Class 3 Discrete Probability Distributions 2/8/2000.
1 Let X represent a Binomial r.v as in (3-42). Then from (2-30) Since the binomial coefficient grows quite rapidly with n, it is difficult to compute (4-1)
Protection vs. false targets in series systems Reliability Engineering and System Safety(2009) Kjell Hausken, Gregory Levitin Advisor: Frank,Yeong-Sung.
SAMPLING TECHNIQUES. Definitions Statistical inference: is a conclusion concerning a population of observations (or units) made on the bases of the results.
Confidence intervals and hypothesis testing Petter Mostad
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
Testing Hypothesis That Data Fit a Given Probability Distribution Problem: We have a sample of size n. Determine if the data fits a probability distribution.
Estimating  0 Estimating the proportion of true null hypotheses with the method of moments By Jose M Muino.
Censoring an observation of a survival r.v. is censored if we don’t know the survival time exactly. usually there are 3 possible reasons for censoring.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
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.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Chapter Seventeen. Figure 17.1 Relationship of Hypothesis Testing Related to Differences to the Previous Chapter and the Marketing Research Process Focus.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
1 8. One Function of Two Random Variables Given two random variables X and Y and a function g(x,y), we form a new random variable Z as Given the joint.
Statistics Chapter 6 / 7 Review. Random Variables and Their Probability Distributions Discrete random variables – can take on only a countable or finite.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Monitoring High-yield processes MONITORING HIGH-YIELD PROCESSES Cesar Acosta-Mejia June 2011.
Analysis of Experimental Data; Introduction
Paging Area Optimization Based on Interval Estimation in Wireless Personal Communication Networks By Z. Lei, C. U. Saraydar and N. B. Mandayam.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
Copyright © Cengage Learning. All rights reserved. 5 Joint Probability Distributions and Random Samples.
Copyright © Cengage Learning. All rights reserved. 5 Joint Probability Distributions and Random Samples.
Sampling and Sampling Distributions. Sampling Distribution Basics Sample statistics (the mean and standard deviation are examples) vary from sample to.
©The McGraw-Hill Companies, Inc. 2008McGraw-Hill/Irwin Probability Distributions Chapter 6.
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.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
MAT 446 Supplementary Note for Ch 3
Discrete Random Variables
Random variables (r.v.) Random variable
Availability Availability - A(t)
Minimum Spanning Tree 8/7/2018 4:26 AM
Hidden Markov Models Part 2: Algorithms
Network Optimization Research Laboratory
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
Presented by Jason L.Y. Lin
11. Conditional Density Functions and Conditional Expected Values
11. Conditional Density Functions and Conditional Expected Values
Experiments, Outcomes, Events and Random Variables: A Revisit
Continuous Random Variables: Basics
Presentation transcript:

A Framework for Network Survivability Characterization Soung C. Liew and Kevin W. Lu IEEE Journal on Selected Areas in Communications, January 1994 (ICC, 1992) Wendy Wen OPlab, IM, NTU

2 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

3 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

4 Objective This paper attempts to formulate a general framework that both includes and extends the existing definitions for network survivability.

5 Survivability Function The probability that a fraction s of the nodes are connected to the central node.  S : network survivability, which is a random variable  e : sample point  E : sample space, E = {e}  P e : probability of each e  S e : probability of nodes connected to the central node

6 Advantage A number of different quantities of interest can be derived from the function.  E[S], s*, s r, p 0

7 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

8 1. S = fraction of nodes connected to the central node under 2. All links are bidirectional. 3. The number of Node is very large. 4. link failures = n A link failure is equally likely to be located anywhere. The locations of the n failures are independent. n ≧ 2 Assumption  self-healing  s = Con.

9 Objective Derive the corresponding survivability function:

10 Derivation (1) Dividing into many small segments, each of length △ s. Size of the sample space is

11 Derivation (2) Each of these sample points is equally likely, N s : the number of ways to make n cuts that result in a survivability of s.

12 Derivation (3): Find N s 1. n(n-1) ways of choosing two cuts to be C l and C r 2. s/ △ s ways of putting the two adjacent cuts, from C l to C r 3. Ways of the remaining (n-2) cuts is.

13 Derivation (4) By definition, Remind that,

14 Fig. 4. Survivability density functions for a ring network. Fig. 5. survivability distribution functions for a ring network.

15 Derivation (5) The various single-value survivability measures can also be easily derived:

Derivation (6): Find p s (S) Let N c be the r.v. associated with the number of cuts.  where δ(x) is the impulse function 總和定理 Pr of n=0 and n=1 Pr of n ≧ 2 P[S=s | n], from eq.12 1, x=0 0, otherwise δ(x) =

17 Derivation (7): Find p s (S) Let MGF of N c is Then, Assume Poisson distribution, Thus, pdf of Poisson MGF of Poisson P(N=0) P(N=1) P(N ≧ 2)=mgf (2) (1-s) Fr.eq. 17:

18 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

19 Procedure 1. Specify disaster type 2. Define “goodness” of networks 3. List the sample points {e}, or all combinations of events 4. Determine the survivability S e 5. Determine or assign probability of each event e 6. Calculate survivability function

20 Step 1. Specify disaster type Different disaster types may have different effects on networks.  severe thunderstorm  cable cut

21 Step 2. Define “ goodness ” of networks We may obtain results depending on the features of the network for which we are calculating survivability.  the number of subscribers connected to a central node  the revenue collected by the network operator

22 Step 3. List all combinations of events Sample space may simply be too large. It maybe can only be done effectively by a computer.

23 Step 4. Determine S e This calculation will depend on our definition of survivability. If as example above, then we would need an efficient algorithm.

24 Step 5. Determine P e This should be based on past observations or experience. If the disaster happens so rarely, one will need to use one’s judgement when assigning probabilities.

25 Step 6. Calculate survivability function By summing the probabilities of all sample points with the same survivability.

26 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

27 24 nodes 26 links the number associated with each link is its length 69 DS3 fiber-optic transmission systems between 29 node pairs Assumption

28 Table I. DS3 demands between nodes of n network

29 Step 1. Specify disaster type Hurricanes

30 Step 2. Define “ goodness ” of networks Total number of surviving DS3’s under link failures

31 Step 3. List all combinations of events Localized disasters: the network survivability can be easily found. Hurricane: 2 26 = 67,108,864 possible combinations of link failures. Assume that more than four link failures are highly unlikely.

32 Step 4. Determine S e For each event e, the survivability is S e = (surviving DS3’s) / 69

33 Step 5. Determine P e (1) Assume that,  link failures are independent  probability of a link failure is proportional to its length ε: to reflect the extent of damage expected of the hurricane,

34 Step 5. Determine P e (2) Probabilities of single, double, triple, and quadruple link failures are: Pr of a link failurePr of the others Pr of two link failures Pr of the others Pr of three link failures Pr of the others Pr of four link failures Pr of the others

35 Step 6. Calculate survivability function (1) For illustration, we condense all survivability within the intervals, (0.02i -0.1, 0.02i +0.1] i=1, 2,..., 50 Show survivability functions for ρ= 0.1 and ρ= 0.2. Remind that,

36 ρ = 0.1 E [ S ] ≈ S * ≈ 0.28 S 10 ≈ 0.8 P o ≈ 0 ρ = 0.2 E [ S ] ≈ S * ≈ 0.28 S 10 ≈ 0.72 P o ≈ 0

37 When increasing ρ from 0.1 to 0.2,  P(s=1) : decreases from to 0.11  E[S] : decreases from to  S 10 : decreases from 0.8 to 0.72  S * : unchanged Step 6. Calculate survivability function (2)

38 Step 6. Calculate survivability function (3) Although the worst-case survivability is 0.28, it corresponds to two events of quadruple link failures  links 3-6, 5-6, 6-7 and 6-8  links 3-6, 5-6, 6-7 and 8-15

links 3-6, 5-6, 6-7, links 3-6, 5-6, 6-7, 8-15

40 OUTLINE 1. Introduction 2. Survivability of a Centralized Ring Network under Link Failures 3. General Procedure for Finding Survivability Function 4. Finding Survivability Function for a Network 5. Conclusions

41 Conclusions Network survivability is characterized by a survivability function. Various quantities of interest can be derived from the survivability function. This framework provides a unified and practical approach to analyzing and designing highly survivable communications networks.

42 Future Work The framework can accommodate situations that involve dependency among failures.

43 The End Thank you for your listening~

44 Fig. 1. A ring network with node failures due to a thunderstorm

45 Table II. DS3’s lost due to link failures of a network

46 Fig. 6. A network for survivability characterization. max l i min l i