{'fraction_non_alphanumeric': 0.019777503090234856, 'fraction_numerical': 0.0, 'mean_word_length': 5.831223628691983, '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}}
Traffic engineering algorithms for agile wavelength-routed wdm networks

It is becoming increasingly evident that wavelength division multiplexing (WDM), evolving gigabits per second to petabits per second, has emerged as the dominant technology to satisfy the growing demand for bandwidth in the next generation Internet. As WDM deployment becomes widespread, new network control and management architecture, and protocols, which take advantage of WDM's capabilities, will need to be developed. This thesis investigates traffic engineering algorithms for WDM networks, with the goals of measuring the performance of existing approaches and developing new algorithms, which provide improved performance and support for services such as survivability. 
First, the virtual topology design and reconfiguration problem with multiple optimization objectives are formulated. An optimization algorithm based on a k-shortest path routing algorithm and a genetic algorithm has been developed to efficiently reconfigure the virtual topologies of WDM networks to traffic changes. Secondly, dynamic routing and wavelength assignment (RWA) problems have been investigated. A set of reservation-based wavelength assignment policies is developed to improve the fairness of dynamic RWA algorithms. Also, an adaptive least loaded routing algorithm is proposed to improve the performance of least loaded routing algorithm. Finally, survivable network design problems are investigated. A mathematical model for a generic protection problem has been developed. A Multi-path protection algorithm is proposed to solve the addressed problem.