Abstract

This paper shows how to design, within practical time constraints, a backup network that suppresses the required resources while providing a guaranteed level of recovery against multiple link failures. The conventional scheme based on robust optimization has the problem of overestimating the backup link capacity. The backup network design scheme proposed herein computes the probabilistic distribution function of required backup link capacity in polynomial time, and so addresses the optimization problem of minimizing the total backup network capacity. For large networks, we introduce the heuristic approach of simulated annealing that adopts our approach to computing backup link capacity. Numerical analyses show that the proposed scheme requires less total backup network capacity than the conventional scheme based on robust optimization.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call