Identification of Critical Infrastructure via PageRank

Abstract

Assessing critical infrastructure vulnerabilities is paramount to arranging efficient plans for their protection. Critical infrastructures are cyber-physical systems that can be represented as a network consisting of nodes and edges and highly interdependent in nature. Given the interdependent nature of critical infrastuctures, failure in one node may cause failure in many others resulting in a cascade of failures. In this paper, we propose a node criticality metric that uses Google’s PageRank algorithm to identify nodes that are likely to fail (are vulnerable), nodes whose failure may cascade to many other sites in the network (are important), and nodes that are both vulnerable and important (are critical). We then present a series of experiments to understand how protecting certain critical nodes can help mitigate massive cascading failures. Simulating failures in a real-world network with and without critical node protections demonstrates the importance of identifying critical nodes in an infrastructure network.