Attack tolerance
In the context of complex networks, attack tolerance is the network's robustness meaning the ability to maintain the overall connectivity and diameter of the network as nodes are removed. Several graph metrics have been proposed to predicate network robustness. Algebraic connectivity is a graph metric that shows the best graph robustness among them.[1]
Attack types
If an attack was to be mounted on a network, it would not be through random nodes but ones that were the most significant to the network. Different methods of ranking are utilized to determine the nodes priority in the network.
Average node degree
This form of attack prioritizes the most connected nodes as the most important ones. This takes into account the network (represented by graph [math]\displaystyle{ G }[/math]) changing over time, by analyzing the network as a series of snapshots (indexed by [math]\displaystyle{ j }[/math]); we denote the snapshot at time [math]\displaystyle{ t_j }[/math] by [math]\displaystyle{ G(t_j) }[/math]. The average of the degree of a node, labeled [math]\displaystyle{ i }[/math], within a given snapshot [math]\displaystyle{ deg_{G(t_j)} }[/math], throughout a time interval (a sequence of [math]\displaystyle{ T }[/math] snapshots) [math]\displaystyle{ \{t_1,...,t_T\} }[/math], is given by:
[math]\displaystyle{ deg_{G}(i;t_{1},t_{n})=\textstyle\frac{1}{T}\sum_{j=1}^T{deg_{G(t_{j})}(i)} }[/math]
Node persistence
This form of attack prioritizes nodes that occur most frequently over a period of time. The equation below calculates the frequency that a node (i) occurs in a time interval [math]\displaystyle{ \{t_1,...,t_T\} }[/math]. When the node is present during the snapshot then equation is equal to 1, but if the node is not present then it is equal to 0.
[math]\displaystyle{ Np_{G}(i;t_{1},t_{n})=\textstyle\frac{1}{T}\sum_{j=1}^T{\delta_{t_{j}}(i)} }[/math]
Where
[math]\displaystyle{ \delta_{t_{j}}(i)=\begin{cases} 1,&\text{if }i\in V_{t_{j}}\text{at }t_{j}^{th}\text{ time step.}\\ 0,&\text{otherwise.} \end{cases} }[/math]
Temporal closeness
This form of attack prioritizes nodes by the summation of temporal distances from one node to all other nodes over a period of time. The equation below calculates the temporal distance of a node (i) by averaging the sum of all the temporal distances for the interval [t1,tn].[2]
[math]\displaystyle{ C_{G}(i;t_{1},t_{n})=\frac{1}{(N-1)}\sum_{j;j\ne i}{d_{ji}(t_{1},t_{n})} }[/math]
Network model tolerances
Not all networks are the same, so it is no surprise that an attack on different networks would have different results. The common method for measuring change in the network is through the average of the size of all the isolated clusters, <s>, and the fraction of the nodes contained in the largest cluster, S.[3] When no nodes have been attacked, both S and <s> equal 1.
Erdős–Rényi model
In the ER model, the network generated is homogeneous, meaning each node has the same number of links. This is considered to be an exponential network. When comparing the connectivity of the ER model when it undergoes random failures vs directed attacks, we are shown that the exponential network reacts the same way to a random failure as it does to a directed attack. This is due to the homogeneity of the network, making it so that it does not matter whether a random node is selected or one is specifically targeted. All the nodes on average are the same in degree therefore attacking one shouldn't cause anymore damage than attacking another. As the number of attacks go up and more nodes are removed, we observe that S decreases non-linearly and acts as if a threshold exists when a fraction of the nodes (f) has been removed, (f≈.28). At this point, S goes to zero. The average size of the isolated clusters behaves opposite, increasing exponentially to <s>= 2, also approaching the threshold line f≈.28, except decreases back to 1 after. This model was tested for a large range of nodes and proven to maintain the same pattern.[3]
Scale-free model
In the scale-free model, the network is defined by its degree distribution following the power law,[4] which means that each node has no set number of links, unlike the exponential network. This makes the scale-free model more vulnerable because there are nodes that are more important than others, and if these nodes were to be deliberately attacked the network would break down. However this inhomogeneous network has its strengths when it comes to random failures. Due to the power law there are many more nodes in the system that have very few links, and probability estimates that these are the nodes that will be targeted (because there are more of them). Severing these smaller nodes will not affect the network as a whole and therefore allows the structure of the network to stay approximately the same. When the scale-free model undergoes random failures, S slowly decreases with no threshold-like behavior and <s> remains approximately 1. This indicates that the network is being broken apart one by one and not by large clusters. However, when the scale-free model undergoes deliberate attack the system behaves similarly to an exponential system, except it breaks down much quicker. As the number of attacks increases, S decreases with a threshold close to f=0.05, and <s> increases to the same threshold and then decreases back to one. The speed at which this type of network breaks down shows the vulnerability of common networks that are used everyday, such as the Internet.[5]
See also
References
- ↑ Alenazi, Mohammed; Sterbenz, James (2015). "Comprehensive comparison and accuracy of graph metrics in predicting network resilience". 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN). pp. 157–164. doi:10.1109/DRCN.2015.7149007. ISBN 978-1-4799-7795-6.
- ↑ Sur, Souvik; Ganguly, Niloy; Mukherjee, Animesh (2015). "Attack tolerance of correlated time-varying social networks with well-defined communities". Physica A: Statistical Mechanics and Its Applications 420: 98–107. doi:10.1016/j.physa.2014.08.074. Bibcode: 2015PhyA..420...98S.
- ↑ 3.0 3.1 Albert, Réka; Jeong, Hawoong; Barabási, Albert-László (2000). "The Internet's Achilles' Heel: Error and attack tolerance of complex networks". Nature 406 (6794): 378–382. doi:10.1038/35019019. PMID 10935628.
- ↑ BARABÁSI, ALBERT-LÁSZLÓ (2014). NETWORK SCIENCE. https://archive.org/details/arxiv-1209.1411.
- ↑ Sorokin, Alexey; Murphey, Robert; Thai, My; Pardalos, Panos (2012). Dynamics of Information Systems: Mathematical Foundations. Springer New York. ISBN 978-1-4614-3905-9.
 |  |
