Fast and traffic-balanced network recovery from massive failures

When a massive network disruption occurs, repair of the damaged network takes time, and the recovery process involves multiple stages. We propose a fast and traffic-balanced network recovery method that can determine an optimal recovery order of failed physical components reflecting the demand of a balance between maximizing total network flow and providing adequate logical path flows during transient recovery stages. The problem is formulated by mixed integer linear programming. The effectiveness of the proposed method was numerically evaluated, and the results show that with the proposed method, the pareto-optimal recovery order can be determined under the balance between total network flow and adequate logical path flows. In addition, the allocated minimum bandwidth of logical path is drastically improved while maximizing total network flow.