{'fraction_non_alphanumeric': 0.007722007722007722, 'fraction_numerical': 0.0, 'mean_word_length': 5.078125, '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}}
Restoration in WDM Mesh Networks by Finite Differences

Fully optical fiber networks that transmit large quantities of information due to multiple applications or because they serve large urban areas need to be maintained fault-free at all times of their operation. The protection and restoration strategies are critical because they provide optical network survivability from a variety of failure scenarios that can occur in this environment. The topology with inherent capability to survive by failures is the mesh one. It is valid because there are usually at least two paths between end nodes. In this paper the approximate finite difference method and the linear one are used to study the problem of the restoration that is executed by shortest path algorithm dynamically.