Relaxed computation of non-bifurcation progressive disaster recovery problem

• Kamamura Shohei

  NTT Network Service Systems Laboratories, NTT Corporation

• Uematsu Yoshihiko

  NTT Network Service Systems Laboratories, NTT Corporation

• Genda Kouichi

  NTT Network Service Systems Laboratories, NTT Corporation

抄録

We propose relaxed computation for the non-bifurcation progressive disaster recovery problem. When massive failure occurs, failed components are gradually repaired since repair resources are limited. Though there are studies on disaster recovery problem to maximize the amount of recovered traffic considering this assumption, they are based on the maximum flow approach, where traffic bifurcation on an arbitrary node is allowed. This condition is not practical in an actual environment. We first formulate non-bifurcation progressive disaster recovery problem as 0-1 integer linear programming. Because the problem is NP-hard, we present a problem-decomposition method and obtain an improvement of 13% over the benchmark method.

収録刊行物

• IEICE Communications Express

  IEICE Communications Express 5 (10), 359-364, 2016

  一般社団法人 電子情報通信学会

キーワード

• disaster recovery
• integer linear programming
• multi-commodity flow
• non-bifurcation

詳細情報

• CRID: 1390282680392822656
• NII論文ID: 130005605945
• DOI: 10.1587/comex.2016xbl0088
• ISSN: 21870136
• Web Site: https://www.jstage.jst.go.jp/article/comex/5/10/5_2016XBL0088/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可