View in EDS

Hybrid connectivity-oriented efficient shielding for robustness enhancement in large-scale networks.

Saved in:
Bibliographic Details
Title: Hybrid connectivity-oriented efficient shielding for robustness enhancement in large-scale networks.
Authors: Wei, Wei1,2,3,4 (AUTHOR) weiwei_ise@haut.edu.cn, Huang, Jie1,2,3,4 (AUTHOR) Hjhaut@stu.haut.edu.cn, Zhang, Qinghui1,2,3 (AUTHOR) zqh131@haut.edu.cn, Ma, Tao5 (AUTHOR) zgwl_mat@unisiot.com, Li, Peng1,6 (AUTHOR) lipeng360@bit.edu.cn
Source: Journal of Network & Computer Applications. Nov2025, Vol. 243, pN.PAG-N.PAG. 1p.
Subject Terms: *FAULT tolerance (Engineering), *NETWORK failures (Telecommunication), *DYNAMIC programming, *ALGORITHMS, *COMPUTER networks, SPANNING trees
Abstract: Network infrastructure protection is critical for ensuring robustness against attacks and failures, yet existing approaches fundamentally limit their scope by addressing either node or edge vulnerabilities in isolation — an unrealistic assumption given real-world scenarios where both element types may fail simultaneously. Our work makes three key advances beyond current state-of-the-art: First, we introduce the novel concept of hybrid connectivity as a unified robustness metric that properly accounts for concurrent node-edge failures, demonstrating through theoretical analysis that traditional single-element metrics require prohibitively high connectivity thresholds. Second, we develop the first practical solution for large-scale networks via our hybrid cut-tree mapping algorithm, which employs an extended node cut formulation with dynamic programming to identify all vulnerable node-edge combinations in linear time — a dramatic complexity reduction from the exponential scaling of existing linear programming methods. Third, we prove and exploit a fundamental structural property that shielding any edge spanning tree plus leaf edges guarantees target hybrid connectivity, enabling our edge spanning tree algorithm to deliver near-optimal solutions at unprecedented scale. Experimental validation confirms our approach maintains 100% protection effectiveness (with no more than 6% cost overhead versus optimal) in small graphs while achieving 99.9% protection coverage in large-scale networks — outperforming all existing heuristics in protection cost while providing a 1 0 5 times speedup over traditional methods. • Hybrid connectivity is used to consider the simultaneous failure of both node and edges. • Hybrid cut-based algorithm is proposed to cost-effectively promote hybrid connectivity. • Concerned cut and edges can be located through tree-based enumeration. • Near optimal solution can be obtained by edge spanning tree quickly. • Network robustness can be promoted above 99.9% with 5 orders of magnitude acceleration. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Network & Computer Applications is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Business Source Index
Description
Abstract:Network infrastructure protection is critical for ensuring robustness against attacks and failures, yet existing approaches fundamentally limit their scope by addressing either node or edge vulnerabilities in isolation — an unrealistic assumption given real-world scenarios where both element types may fail simultaneously. Our work makes three key advances beyond current state-of-the-art: First, we introduce the novel concept of hybrid connectivity as a unified robustness metric that properly accounts for concurrent node-edge failures, demonstrating through theoretical analysis that traditional single-element metrics require prohibitively high connectivity thresholds. Second, we develop the first practical solution for large-scale networks via our hybrid cut-tree mapping algorithm, which employs an extended node cut formulation with dynamic programming to identify all vulnerable node-edge combinations in linear time — a dramatic complexity reduction from the exponential scaling of existing linear programming methods. Third, we prove and exploit a fundamental structural property that shielding any edge spanning tree plus leaf edges guarantees target hybrid connectivity, enabling our edge spanning tree algorithm to deliver near-optimal solutions at unprecedented scale. Experimental validation confirms our approach maintains 100% protection effectiveness (with no more than 6% cost overhead versus optimal) in small graphs while achieving 99.9% protection coverage in large-scale networks — outperforming all existing heuristics in protection cost while providing a 1 0 5 times speedup over traditional methods. • Hybrid connectivity is used to consider the simultaneous failure of both node and edges. • Hybrid cut-based algorithm is proposed to cost-effectively promote hybrid connectivity. • Concerned cut and edges can be located through tree-based enumeration. • Near optimal solution can be obtained by edge spanning tree quickly. • Network robustness can be promoted above 99.9% with 5 orders of magnitude acceleration. [ABSTRACT FROM AUTHOR]
ISSN:10848045
DOI:10.1016/j.jnca.2025.104325