成本效益的网络改进,以实现最大的路径多样性

Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz
{"title":"成本效益的网络改进,以实现最大的路径多样性","authors":"Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz","doi":"10.1109/RNDM.2014.7014952","DOIUrl":null,"url":null,"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.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Cost-Efficient network improvement to achieve maximum path diversity\",\"authors\":\"Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz\",\"doi\":\"10.1109/RNDM.2014.7014952\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":299072,\"journal\":{\"name\":\"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"volume\":\"14 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.7014952\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.7014952","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

通信网络容易因针对性攻击或大规模灾难而出现故障。可以利用多样性等机制来改进网络以抵御挑战,而多样性可以通过增加链接来改进,但由于预算有限,实现最大弹性是不可行的。因此,需要一种经济有效地提高网络多样性的算法。在本文中,我们提出了一种启发式算法,通过添加链路来提高图的多样性,同时最小化链路添加的代价。我们分析了非图和改进图对目标攻击的流鲁棒性。我们的研究结果表明,路径多样性改进的图比通过向最低度节点添加链接改进的图更能抵御攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cost-Efficient network improvement to achieve maximum path diversity
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信