Cost-constrained and Centrality-balanced Network Design Improvement
Rak J. and Sterbenz J.P. G. and Sterbenz J.P. G. and Shen G. and Walkowiak K.
Improving resilience against failures and targeted attacks is an important aspect of network design. The resilience and cost of networks are two opposing objectives in which a designer should consider when building networks. We develop a heuristic algorithm that balances the centrality of networks by adding a set of links that minimizes the variance of graph centrality measures in a least costly fashion. Moreover, our algorithm limits the addition of links by a budget constraint. We apply our algorithm to three different realistic topologies and measure the performance of the improved graphs in terms of flow robustness when subjected to targeted attacks. Our results indicate that degree-balanced networks are more resilient than both betweenness-balanced and closeness-balanced networks.
M. J. Alenazi et al., "Cost-constrained and Centrality-balanced Network Design Improvement," Proceedings of the 6th International Workshop on Reliable Networks Design and Modeling, RNDM 2014, pp. 194-201, Institute of Electrical and Electronics Engineers (IEEE), Jan 2014.
The definitive version is available at http://dx.doi.org/10.1109/RNDM.2014.7014951
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; Flow Graphs; Heuristic Algorithms; Optimization; Reliability; Robustness (Control Systems); Topology; Augmentation; Betweenness; Centrality Metrics; Closeness; Connectivity; Degree; Dependability; Network Costs; Network Design; Network Resilience; Survivability; Design
International Standard Book Number (ISBN)
Electronic OCLC #
Article - Conference proceedings
© 2014 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.