Multi-staged network restoration from massive failures considering transition risks

Abstract

In a scenario of restoration from massive failures, a network is repaired through multiple restoration stages because availability of repair resources is limited. In a practical case, a network operator should assure the reachability of important traffic in transient stages, even as risks and/or operational overheads caused by stage transitions are suppressed. We discuss the novel problem of optimizing both traffic recovery ratio and transition risks caused by paths switching operation. We formulate our problem as linear programming, and show that it obtains pareto-optimal solutions of traffic recovery versus transition risks. We also propose a heuristic algorithm for applying networks consisting of a few hundred nodes, and it could produce sub-optimal solutions within 4% difference from optimal solutions.

Relaxed computation of non-bifurcation progressive disaster recovery problem

“…[2] considered fairness between flows, and Ref. [3] considered transition risks caused by the path switching operation.…”

“…The existing methods [1,2,3], which use a mathematical programming approach, are based on the maximum flow approach, where traffic bifurcation on an arbitrary node is allowed. For an actual transport network environment, however, traffic bifurcation is only allowed on the source node for the purpose of protection; traffic bifurcation for load balancing is not practical.…”