
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Fast and FlowControlled MultiStage Network Recovery from LargeScale Physical Failures
Kouichi GENDA Hiroshi YAMAMOTO Shohei KAMAMURA
Publication
IEICE TRANSACTIONS on Communications
Vol.E99B
No.8
pp.18241834 Publication Date: 2016/08/01 Publicized: 2016/03/01 Online ISSN: 17451345
DOI: 10.1587/transcom.2016EBP3009 Type of Manuscript: PAPER Category: Network Keyword: network recovery, largescale failure, flow control, bandwidth allocation, linear programming,
Full Text: PDF>>
Summary:
When a massive network disruption occurs, repair of the damaged network takes time, and the recovery process involves multiple stages. We propose a fast and flowcontrolled multistage network recovery method for determining the paretooptimal recovery order of failed physical components reflecting the balance requirement between maximizing the total amount of traffic on all logical paths, called total network flow, and providing adequate logical path flows. The paretooptimal problem is formulated by mixed integer linear programming (MILP). A heuristic algorithm, called the groupedstage recovery (GSR), is also introduced to solve the problem when the problem formulated by MILP is computationally intractable in a largescale failure. The effectiveness of the proposed method was numerically evaluated. The results show that the paretooptimal recovery order can be determined from the balance between total network flow and adequate logical path flows, the allocated minimum bandwidth of the logical path can be drastically improved while maximizing total network flow, and the proposed method with GSR is applicable to largescale failures because a nearly optimal recovery order with less than 10% difference rate can be determined within practical computation time.


