{'fraction_non_alphanumeric': 0.024102311854402363, 'fraction_numerical': 0.003935071323167732, 'mean_word_length': 5.603896103896104, '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}}
Providing quality-of-protection classes through control-message scheduling in DWDM mesh networks with capacity sharing

This paper considers the problem of providing quality-of-protection (QoP) classes and improving the failure-recovery time performance in dense wavelength-division-multiplexing (DWDM) networks that use mesh-based path restoration schemes with capacity sharing. We focus on the signaling process required for reconfiguring the nodes along the preplanned restoration paths, and propose a novel approach for reducing the restoration time and meeting the QoP requirements by coordinating the setup procedures for the backup paths through scheduling. We present priority-based online scheduling algorithms that are amenable to distributed implementation for the problems of: 1) minimizing the worst case restoration time and 2) maximizing the number of connections that meet their QoP-class-specific restoration time deadlines. We also present mixed-integer-linear-program (MILP) formulations for both problems for comparison purposes. The online scheduling methods that we propose use simple connection and/or class-specific information and can be easily implemented with minor modifications to the currently proposed signaling protocols. We apply these methods to signaling protocols that require cross-connect configurations at different nodes to be done in sequence as in the current generalized multiprotocol label switching specification, as well as signaling protocols that allow cross-connect configurations to be done in parallel. It is shown that in both cases, significant performance improvements are achievable through scheduling in terms of both the QoP grades that can be supported and the restoration times, with both the MILP solutions and the heuristics. The improvement in restoration time and restorability through our heuristics can be quite high (e.g., increase from a network restorability performance of 40% to a network restorability of 88%, and a 12% reduction in worst case restoration time).