Optimal pruned tree-cut mapping-based fast shielding for large-scale networks

Abstract

Random failure is a common threat to a network, where the failure of a few edges can disconnect a large-scale sparse network. To enhance the robustness of network, the shielding of important edges is a practical strategy, where the cut is a useful entity to help locate important edges in existing shielding methods. However, as there is no available way to quickly locate target cuts, the existing shielding algorithm is not efficient enough and can only be applied to small-scale backbone networks. Fortunately, by using the optimal pruned tree-cut mapping, we found an efficient and high-precision cut edge enumeration method, which can help quickly locate target cuts and their edges in a large-scale network, leading to a cost-effective shielding plan. Theoretical analysis indicates that more than 99% of candidate cuts can be found with a limited number of preprocessing passes, and experimental results in typical networks show that in small-scale networks, with little extra cost (< 6%), the serial implementation of the algorithm in an off-shelf computing node can be 6 orders of magnitude faster than the optimal method, while in large-scale sparse networks with a million nodes, it can also help defend at least 99.9% of random failures with only tens of seconds of preprocessing overhead.