IEEE Transactions on Network and Service Management · 2019 · 35 citations · 28 references
ComputingComputer EngineeringFault ToleranceFault-tolerant SystemsOptimizationAvailability EngineeringBackup SystemsNetwork OptimizationNetwork ReliabilityNetwork RobustnessReliable Storage SystemsBackup DesignHeuristic ApproachMixed-integer OptimizationMixed-integer ProgrammingPolynomial Time ComplexityPolynomial-time Algorithms
This paper proposes a backup network design scheme that can determine backup link capacity in practical time. The proposed scheme suppresses the required backup link capacity while providing a guaranteed level of recovery against multiple independent link failures. The conventional scheme is based on robust optimization and suffers from the problem of overestimating the backup link capacity. The proposed scheme addresses the overestimation problem by computing the probabilistic distribution function of required backup link capacity in polynomial time. We formulate the backup network design problem with the proposed scheme as a mixed integer linear programming problem to minimize the total required backup link capacity. We prove that the decision version of backup network design problem is NP-complete. Given that network size will continue to increase, we introduce a heuristic approach of simulated annealing to solve the same problem. Numerical results show that the proposed scheme requires less total backup link capacity than the conventional scheme based on robust optimization.
28