{'fraction_non_alphanumeric': 0.019980970504281638, 'fraction_numerical': 0.0009514747859181732, 'mean_word_length': 5.493827160493828, '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}}
Locating Datacenter Link Faults with a Directed Graph Convolutional Neural Network

Datacenters alongside many domains are well represented by directed graphs, and there are many datacenter problems where deeply learned graph models may prove advantageous. Yet few applications of graph-based convolutional neural networks (GCNNs) to datacenters exist. Few of the GCNNs in the literature are explicitly designed for directed graphs, partly owed to the relative dearth of GCNNs designed specifically for directed graphs. We present therefore a convolutional operation for directed graphs, which we apply to learning to locate the faulty links in datacenters. Moreover, since the detection problem would be phrased as link-wise classification, we propose constructing a directed linegraph, where the problem is instead phrased as a vertexwise classification. We find that our model detects more link faults than the comparison models, as measured by McNemar’s test, and outperforms the comparison models in respect of the F1-score, precision and recall.