Cost-efficient Network Improvement to Achieve Maximum Path Diversity
Rak J. and Sterbenz J.P. G. and Shen G. and Walkowiak K.
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.
M. J. Alenazi et al., "Cost-efficient Network Improvement to Achieve Maximum Path Diversity," Proceedings of the 6th International Workshop on Reliable Networks Design and Modeling, RNDM 2014, pp. 202-208, Institute of Electrical and Electronics Engineers (IEEE), Jan 2014.
The definitive version is available at http://dx.doi.org/10.1109/RNDM.2014.7014952
6th International Workshop on Reliable Networks Design and Modeling, RNDM 2014 (2014: Nov. 17-19, Barcelona, Spain)
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)
Electronic OCLC #
Article - Conference proceedings
© 2014 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.