{'fraction_non_alphanumeric': 0.0304, 'fraction_numerical': 0.0016, 'mean_word_length': 5.798913043478261, '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}}
Scheduling Advance Reservation Requests for WDM Networks with Static Traffic Demands

Telecommunication and grid computing applications demand high bandwidth data channels that offer guarantees with respect to service availability. Such applications include: remote surgery, remote experimentation, video on-demand (VOD), teleconferencing, and bulk transfers. Furthermore, by forecasting traffic patterns internet service providers (ISP) attempt to optimize network resources in order to lower operational costs during peak periods of bandwidth consumption. Advance reservation for wavelength division multiplexed (WDM) networks can address some of these issues by reserving high volume communication channels (i.e., lightpaths) beforehand. In this paper we develop a mathematical model to solve the problem of scheduling lightpaths in advance. The optimal solution is presented as a mixed integer linear program (MILP) with the assumption that all traffic is static and the network is centrally controlled. Furthermore we have developed two novel meta-heuristics based on: 1) a greedy implementation (local search), and 2) simulated annealing (SA). The meta-heuristics have shown to produce good approximate solutions in a reasonable amount of time.