Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures

Akihiro KADOHATA  Takafumi TANAKA  Wataru IMAJUKU  Fumikazu INUZUKA  Atsushi WATANABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E99-A    No.8    pp.1510-1517
Publication Date: 2016/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E99.A.1510
Type of Manuscript: Special Section PAPER (Special Section on Information and Communication Systems for Safe and Secure Life)
disaster restoration,  catastrophic failure,  spanning-tree,  linear programming,  

Full Text: PDF>>
Buy this Article

This paper addresses the issue of implementing a sequence for restoring fiber links and communication paths that have failed due to a catastrophe. We present a mathematical formulation to minimize the total number of steps needed to restore communication paths. We also propose two heuristic algorithms: Minimum spanning tree - based degree order restoration and Congestion link order restoration. Numerical evaluations show that integer linear programming based order restoration yields the fewest number of restoration steps, and that the proposed heuristic algorithms, when used properly with regard to the accommodation rate, are highly effective for real-world networks.