Cost-constrained and Centrality-balanced Network Design Improvement

Editor(s)

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

Abstract

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.

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; 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)

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