{'fraction_non_alphanumeric': 0.022727272727272728, 'fraction_numerical': 0.000946969696969697, 'mean_word_length': 5.254437869822485, '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}}
A novel survivable traffic grooming algorithm in WDM mesh networks

In this paper, we focus on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups) constraints in WDM mesh networks. Our objective is to minimize the total network resource for a given traffic demands metric. An efficient simplified ILP (Integer Linear Programming) mathematical formulation is presented. Considering the computational complexity of ILP, a fast heuristic algorithm named Cross Layer Information Routing & Multi-Layer Traffic Grooming (CLIR-MLTG) is proposed and evaluated. We compare our simplified ILP model with the regular ILP model, and the CLIR-MLTG algorithm is also compared both with our simplified model and a heuristic algorithm named SSR in the literature [1]. Finally, we demonstrate in numerical results that our simplified ILP model obtains optimal performance and costs much less time compared to the regular ILP model, and the CLIR-MLTG algorithm outperforms the SSR scheme and it obtains similar performance compared to the ILP model.