Disaster Recovery for Transport Network through Multiple Restoration Stages

Shohei KAMAMURA  Daisaku SHIMAZAKI  Kouichi GENDA  Koji SASAYAMA  Yoshihiko UEMATSU  

Publication
IEICE TRANSACTIONS on Communications   Vol.E98-B   No.1   pp.171-179
Publication Date: 2015/01/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E98.B.171
Type of Manuscript: PAPER
Category: Network System
Keyword: 
linear programming,  disaster recovery,  multiple stages,  pareto-optimization,  restoration,  

Full Text: PDF(2MB)>>
Buy this Article




Summary: 
This paper proposes a disaster recovery method for transport networks. In a scenario of recovery from a disaster, a network is repaired through multiple restoration stages because repair resources are limited. In a practical case, a network should provide the reachability of important traffic in transient stages, even as service interruption risks and/or operational overheads caused by transport paths switching are suppressed. Then, we define the multi-objective optimization problem: maximizing the traffic recovery ratio and minimizing the number of switched transport paths at each stage. We formulate our problem as linear programming, and show that it yields pareto-optimal solutions of traffic recovery versus the number of switched paths. We also propose a heuristic algorithm for applying to networks consisting of a few hundred nodes, and show that it can produce sub-optimal solutions that differ only slightly from optimal solutions.