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

Akihiro KADOHATA; Takafumi TANAKA; Wataru IMAJUKU; Fumikazu INUZUKA; Atsushi WATANABE

doi:10.1587/transfun.E99.A.1510

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

Akihiro KADOHATA, Takafumi TANAKA, Wataru IMAJUKU, Fumikazu INUZUKA, Atsushi WATANABE

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.8 pp.1510-1517

Publication Date: 2016/08/01

Publicized

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)

Category

Authors

Akihiro KADOHATA
  NTT Corporation
Takafumi TANAKA
  NTT Corporation
Wataru IMAJUKU
  NTT Corporation
Fumikazu INUZUKA
  NTT Corporation
Atsushi WATANABE
  NTT Electronics Corporation

Keyword

disaster restoration, catastrophic failure, spanning-tree, linear programming

Cite this

Copy

Akihiro KADOHATA, Takafumi TANAKA, Wataru IMAJUKU, Fumikazu INUZUKA, Atsushi WATANABE, "Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures" in IEICE TRANSACTIONS on Fundamentals, vol. E99-A, no. 8, pp. 1510-1517, August 2016, doi: 10.1587/transfun.E99.A.1510.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1510/_p

Copy

@ARTICLE{e99-a_8_1510,
author={Akihiro KADOHATA, Takafumi TANAKA, Wataru IMAJUKU, Fumikazu INUZUKA, Atsushi WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures},
year={2016},
volume={E99-A},
number={8},
pages={1510-1517},
abstract={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.},
keywords={},
doi={10.1587/transfun.E99.A.1510},
ISSN={1745-1337},
month={August},}

Copy

TY - JOUR
TI - Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1510
EP - 1517
AU - Akihiro KADOHATA
AU - Takafumi TANAKA
AU - Wataru IMAJUKU
AU - Fumikazu INUZUKA
AU - Atsushi WATANABE
PY - 2016
DO - 10.1587/transfun.E99.A.1510
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2016
AB - 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.
ER -