Visualisation of social networks using CAVALIER
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
9/11: One year later: taking on terrorism
IEEE Spectrum - They might be giants
Network robustness and graph topology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
The symmetry ratio of a network
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
The symmetry ratio of a network
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Resilience in computer network management
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
The Maximum Degree & Diameter-Bounded Subgraph and its Applications
Journal of Mathematical Modelling and Algorithms
| Hi-index | 0.00 |
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity, and an extension of data farming which we call network farming. Our results show that symmetrical designed networks generally outperform randomly generated networks, although ring-like structures are very vulnerable. Under targeted attacks, most networks begin to fail when the number of attacks is equal to the node connectivity. Examining the distribution of real-world terrorist attacks, we show that these can be modelled by a Poisson statistical distribution, leading to recommendations for the node connectivity required at different threat levels.