{'fraction_non_alphanumeric': 0.027312775330396475, 'fraction_numerical': 0.0, 'mean_word_length': 5.276243093922652, '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}}
On Multi-Link Failure Localization in All-Optical Networks

Link failure localization has been an important and challenging problem for all-optical networks. The most general monitoring structure, called path-trial, is a light-path into which optical signals are launched and monitored. How to minimize the number of required path-trials is critical to the expense of this technique. Existing solutions are limited to localizing single link failure or handling only small networks. Moreover, some practical constraints, like lacking of knowledge of the failure quantity, are ignored. To overcome these limitations is prospective but quite challenging. To this end, we address the multi-link failure localization problem. On one hand, for moderate-size networks, we provide a tree-decomposition based centralized algorithm; on the other hand, a random walk based localized algorithm for large-scale networks is proposed. In addition, we further adapt these two algorithms to cope with three practical constraints. Theoretical analysis and simulation results are included to prove the correctness and efficiency of the proposed solution.