Optimal redundancy allocation for information technology disaster recovery in the network economy. Benjamin B.M. Shao IEEE Transaction on Dependable and Secure Computing, Vol. 2, NO. 3, July-September 2005 Presented by: Derek KD Jiang 江坤道. Agenda. Introduction
Benjamin B.M. Shao
IEEE Transaction on Dependable and Secure Computing, Vol. 2, NO. 3, July-September 2005
Presented by: Derek KD Jiang 江坤道
IT function m fails against disaster d only when all of its selected solutions fail at the same time.
In other words, as long as one of the selected solutions survives the disaster, IT function would be in operation.
The sum of failure probabilities of each IT function due to any disasters.Solution procedure
The recursive formula, where any disasters.m < MSolution procedure
For T not in the range, Fm(T) is defined as 1, so it won’t be chosen.
(X21, X22, X23)=(0, 0, 1), (0, 1, 0), (1, 0, 0). The minimum F2(T) = 0.02827 is associated with (0, 0, 1).
The minimum F1(14) is associated with (X11, X12 , X13, X14) = (0, 1, 0, 1), with F* = 0.03905 using F2(6) = 0.02827. Namely, the maximum survivability S* against flooding equal 1 – F* = 1 – 0.03905 = 0.96095.
Thanks for your patience any disasters.