{'fraction_non_alphanumeric': 0.034482758620689655, 'fraction_numerical': 0.0, 'mean_word_length': 5.424778761061947, '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}}
The global fault-tolerance of interconnection networks

In this paper, we introduce a new concept in fault-tolerance, namely the global fault-tolerance of interconnection networks. We pose the problem of characterizing the fault-tolerance of an interconnection network, modelled as an undirected unweighted graph, by a scalar, in a global manner. This can be achieved by defining an adequate metric. In this paper, we propose such a metric and we apply it on two comparative analysis: for three infinite families of minimum broadcast graphs (hypercubes, recursive circulants, and Knodel graphs), and for five families of hypercubic graphs (butterfly, wrapped butterfly, shuffle exchange, de Bruijn, and cube connected cycles)