Optimal redundancy against disjoint vulnerabilities in networks
Sebastian M. Krause, Michael M. Danziger, Vinko Zlati\'c

TL;DR
This paper introduces a novel color-avoiding percolation method to identify optimal redundant paths in networks with disjoint vulnerabilities, enhancing security and robustness analysis.
Contribution
It develops algorithms and an analytic theory for color-avoiding connectivity, revealing hidden network structures and improving redundancy strategies against disjoint vulnerabilities.
Findings
Less connected countries have higher secure communication probability.
The theory uncovers hidden connectivity in the Internet.
Results can improve robustness in various complex systems.
Abstract
Redundancy is commonly used to guarantee continued functionality in networked systems. However, often many nodes are vulnerable to the same failure or adversary. A "backup" path is not sufficient if both paths depend on nodes which share a vulnerability.For example, if two nodes of the Internet cannot be connected without using routers belonging to a given untrusted entity, then all of their communication-regardless of the specific paths utilized-will be intercepted by the controlling entity.In this and many other cases, the vulnerabilities affecting the network are disjoint: each node has exactly one vulnerability but the same vulnerability can affect many nodes. To discover optimal redundancy in this scenario, we describe each vulnerability as a color and develop a "color-avoiding percolation" which uncovers a hidden color-avoiding connectivity. We present algorithms for…
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.
Taxonomy
TopicsComplex Network Analysis Techniques · Graph theory and applications · Opinion Dynamics and Social Influence
