{'fraction_non_alphanumeric': 0.0252486610558531, 'fraction_numerical': 0.0, 'mean_word_length': 5.54, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Graph-Based Framework for Real-Time Vulnerability Assessment of Road Networks

The ability to detect critical spots in transportation networks is fundamental to improve traffic operations and road-network resilience in smart cities. Real-time monitoring of these networks, especially in very large metropolitan areas, is a compelling challenge due to the complexity of computing robustness metrics. This paper presents a framework for identifying vulnerabilities in very-large road networks. The framework adopts graph-based modeling of road networks and exploits big-data techniques and technologies for processing such large and complex graphs. First, we use the framework to prove the existence of a significant correlation between global efficiency and betweenness centrality. Then, we focus on an efficient algorithm, integrated in the framework, to rank the nodes according to this metric for finding potential vulnerabilities of a road network. To keep computation time under a "quasi" real-time threshold, a fast, requirement-driven, approximated strategy for computing betweenness centrality is adopted. The evaluation shows that the algorithm, integrated in the framework, exhibits a very good approximation for the most critical nodes, thus being well-suited for on-line operational monitoring.