Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz
{"title":"Cost-constrained and centrality-balanced network design improvement","authors":"Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz","doi":"10.1109/RNDM.2014.7014951","DOIUrl":null,"url":null,"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.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2014.7014951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
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.