{'fraction_non_alphanumeric': 0.016739446870451237, 'fraction_numerical': 0.0, 'mean_word_length': 5.674757281553398, '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}}
Dig the potential of fixed routing strategy

As the dynamic data traffic became the dominant traffic pattern in optical networks, adaptive routing strategy has already become the focus of recent studies on the routing and wavelength assignment (RWA) problem, which will determine the candidate path or path set adaptively and dynamically according to the real-time wavelength utilization status. Without any doubt, adaptive routing strategy can significantly reduce the overall call blocking probability (CBP), but it also remarkably increases the computational complexity of the RWA algorithm, especially in large-scale networks. This paper aims to dig the potential of fixed routing strategy for better overall CBP feature as well as its dramatic advantage over its adaptive counterpart in terms of much lower computational complexity. Both single and alternate routing scenarios will be considered in our study: In the investigation on single routing scenario, a heuristic method for determining optimized paths route for all node pairs will be proposed, which is developed from an approximate analysis model based on path decomposition approach; turn to alternate routing scenario, fairness among diverse connection requests will be introduced as another criterion, and our novel fixed classified alternate routing (F_CAR) approach also show its competitive performance.