Employing the cluster of node cut sets to improve the robustness of the network measured by connectivity

IF 9.4 1区 工程技术 Q1 ENGINEERING, INDUSTRIAL Reliability Engineering & System Safety Pub Date : 2024-10-30 DOI:10.1016/j.ress.2024.110612
{"title":"Employing the cluster of node cut sets to improve the robustness of the network measured by connectivity","authors":"","doi":"10.1016/j.ress.2024.110612","DOIUrl":null,"url":null,"abstract":"<div><div>Protection of critical nodes or edges can help defend networks from failures caused by natural disasters or intended attacks. Node protection becomes the only way when edge protection is not possible, where node connectivity is usually used to measure network robustness due to its effectiveness. Although simple, node connectivity-oriented node consolidation optimization is still NP-hard, especially when dealing with large numbers of nodes. To address the problem, by leveraging the mapping between nodes and traversal trees, per-node cluster of node cut sets is used to identify nominee nodes, which are then conditionally consolidated through a extended dual tree-based selection process. Experimental results show that in small graphs with tens of nodes where the optimal algorithm is applicable, an acceleration ratio of more than <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>5</mn></mrow></msup></mrow></math></span> (at most <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>6</mn></mrow></msup></mrow></math></span>) is observed at the expense of about 6% extra cost. In large graphs with millions of nodes, the proposed algorithm can help promote node connectivity of more than 99.9% of node pairs, which is far better than commonly used heuristics. Its inherent ready-for-paralleling capability paves the way for more speedups.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":null,"pages":null},"PeriodicalIF":9.4000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reliability Engineering & System Safety","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0951832024006835","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

Protection of critical nodes or edges can help defend networks from failures caused by natural disasters or intended attacks. Node protection becomes the only way when edge protection is not possible, where node connectivity is usually used to measure network robustness due to its effectiveness. Although simple, node connectivity-oriented node consolidation optimization is still NP-hard, especially when dealing with large numbers of nodes. To address the problem, by leveraging the mapping between nodes and traversal trees, per-node cluster of node cut sets is used to identify nominee nodes, which are then conditionally consolidated through a extended dual tree-based selection process. Experimental results show that in small graphs with tens of nodes where the optimal algorithm is applicable, an acceleration ratio of more than 105 (at most 106) is observed at the expense of about 6% extra cost. In large graphs with millions of nodes, the proposed algorithm can help promote node connectivity of more than 99.9% of node pairs, which is far better than commonly used heuristics. Its inherent ready-for-paralleling capability paves the way for more speedups.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用节点切割集群来提高以连通性衡量的网络鲁棒性
保护关键节点或边缘有助于保护网络免受自然灾害或蓄意攻击造成的故障。当边缘保护无法实现时,节点保护就成了唯一的办法,而节点连通性因其有效性通常被用来衡量网络的鲁棒性。面向节点连通性的节点整合优化虽然简单,但仍是 NP 难题,尤其是在处理大量节点时。为了解决这个问题,我们利用节点和遍历树之间的映射关系,使用节点切割集的每个节点簇来识别提名节点,然后通过扩展的基于对偶树的选择过程有条件地合并这些节点。实验结果表明,在适用最优算法的数十个节点的小型图中,加速比超过 105(最多 106),而额外成本约为 6%。在拥有数百万节点的大型图中,所提出的算法可以帮助促进 99.9% 以上节点对的节点连接,远远优于常用的启发式算法。其固有的可并行能力为更快的速度铺平了道路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Reliability Engineering & System Safety
Reliability Engineering & System Safety 管理科学-工程:工业
CiteScore
15.20
自引率
39.50%
发文量
621
审稿时长
67 days
期刊介绍: Elsevier publishes Reliability Engineering & System Safety in association with the European Safety and Reliability Association and the Safety Engineering and Risk Analysis Division. The international journal is devoted to developing and applying methods to enhance the safety and reliability of complex technological systems, like nuclear power plants, chemical plants, hazardous waste facilities, space systems, offshore and maritime systems, transportation systems, constructed infrastructure, and manufacturing plants. The journal normally publishes only articles that involve the analysis of substantive problems related to the reliability of complex systems or present techniques and/or theoretical results that have a discernable relationship to the solution of such problems. An important aim is to balance academic material and practical applications.
期刊最新文献
Employing the cluster of node cut sets to improve the robustness of the network measured by connectivity Preventive maintenance strategy for multi-component systems in dynamic risk assessment A new reliability health status assessment model for complex systems based on belief rule base Toward the resilience of UAV swarms with percolation theory under attacks Health management of power batteries in low temperatures based on Adaptive Transfer Enformer framework
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1