Cost-efficient Network Improvement to Achieve Maximum Path Diversity

Editor(s)

Rak J. and Sterbenz J.P. G. and Shen G. and Walkowiak K.

Abstract

Communication networks are prone to failures due to targeted attacks or large-scale disasters. Networks can be improved to withstand challenges using mechanisms such as diversity, which can simply be improved by adding links, however achieving maximum resilience is not feasible due to limited budget. Therefore, algorithms that improve the diversity of networks cost-efficiently are necessary. In this paper, we present a heuristic algorithm that adds links to improve the diversity of the graph while minimizing the cost of link addition. We analyze the flow robustness of non- and improved graphs against targeted attacks. Our results indicate that path-diversity-improved graphs are more resilient to attacks than graphs improved by adding links to the lowest degree nodes.

Meeting Name

6th International Workshop on Reliable Networks Design and Modeling, RNDM 2014 (2014: Nov. 17-19, Barcelona, Spain)

Department(s)

Electrical and Computer Engineering

Keywords and Phrases

Algorithms; Budget Control; Costs; Heuristic Algorithms; Optimization; Reliability; Robustness (Control Systems); Augmentation; Back-Bone Network; Connectivity; Network Costs; Network Design; Network Resilience; Path Diversity; Survivability; Flow Graphs

International Standard Book Number (ISBN)

978-1479970407

Electronic OCLC #

917876545

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2014 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jan 2014

Link to Full Text

Share

 
COinS