{'fraction_non_alphanumeric': 0.017969451931716084, 'fraction_numerical': 0.0, 'mean_word_length': 4.957219251336898, '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}}
Parameterized Exhaustive Routing with First Fit for RSA Problem Variants

We present a new single-step solution approach for the routing and spectrum allocation (RSA) problem that integrates the first-fit (FF) heuristic with a new routing strategy that we refer to as “parameterized exhaustive routing.” Our approach is to explore the whole routing space for a subset of the traffic requests, e.g., those with the largest demands or those of higher priority or importance. For each of the remaining requests we employ a greedy heuristic to select one of the candidate paths jointly with spectrum allocation. Our solution represents a two-parameter family of algorithms that bridges the gap between an exhaustive search of the routing space and current two-step methodologies for the RSA problem that select paths for each traffic request in isolation. The parameter values may be used to trade off the quality of the final solution and the computational requirements. Our results indicate that exploring the joint routing space of even a few large requests leads to better solutions than purely greedy approaches.