Protecting infrastructure networks from cost-based attacks
Xingang Wang, Shuguang Guan, and Choy Heng Lai

TL;DR
This paper investigates optimal resource allocation strategies to defend complex networks against cost-based attacks, demonstrating that tailored defense distributions can significantly enhance network resilience.
Contribution
It introduces a method to determine optimal defense resource distribution considering attack costs, revealing dependence on network size, density, and heterogeneity.
Findings
Optimal defense distribution exists for complex networks.
Larger, sparser, and more heterogeneous networks benefit more from defense optimization.
Proper resource allocation minimizes damage from cost-based attacks.
Abstract
It has been known that heterogeneous networks are vulnerable to the intentional removal of a small fraction of highly connected or loaded nodes, which implies that, to protect a network effectively, a few important nodes should be allocated with more defense resources than the others. However, if too many resources are allocated to the few important nodes, the numerous less-important nodes will be less protected, which, when attacked all together, still capable of causing a devastating damage. A natural question therefore is how to efficiently distribute the limited defense resources among the network nodes such that the network damage is minimized whatever attack strategy the attacker may take. In this paper, taking into account the factor of attack cost, we will revisit the problem of network security and search for efficient network defense against the cost-based attacks. The study…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
