Partial Network Recovery to Maximize Traffic Demand

Author

Yu, Hongfang ; Yang, Chunxia

Author_Institution

Sch. of Commun. & Inf. Eng., Univ. of Electron. & Technol. of China, Chengdu, China

Volume

15

Issue

12

fYear

2011

fDate

12/1/2011 12:00:00 AM

Firstpage

1388

Lastpage

1390

Abstract

A natural disaster will cause large-scale failures and damage many network components, which in turn affect users?traffic. This paper addresses the problem of selecting a subset of the failed components to repair after massive failures so as to meet the given traffic demand as much as possible with limited recovery resources (e.g., workforce). We formulate the problem using mixed integer programming (MIP), and then propose an effective heuristic algorithm to solve the MIP. Simulations are performed to evaluate and compare the performance of the MIP and heuristics.

Keywords

integer programming; telecommunication network reliability; heuristic algorithm; large-scale failures; limited recovery resources; massive failure; maximize traffic demand; mixed integer programming; natural disaster; network component; partial network recovery; Approximation algorithms; Computational modeling; Heuristic algorithms; Maintenance engineering; Routing; WDM networks; Large-scale failures; mixed integer programming; recovery resources; traffic demand;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2011.103111.111668

Filename

6078374