{'fraction_non_alphanumeric': 0.017932489451476793, 'fraction_numerical': 0.0, 'mean_word_length': 5.636363636363637, '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}}
Performance Evaluation of the VNT Reconfiguration Algorithm Based on Traffic Prediction

In a previous work, the Virtual Network Topology Reconfiguration problem based on Traffic Prediction (VENTURE) was proposed as a means of efficiently adapting core virtual network topology (VNT) to the near-future traffic. Although the benefits obtained by the VENTURE algorithm compared to using a purely reactive VNT reconfiguration approach seems to be clear, margin for improvement still remain and alternative solving methods for the VENTURE problem need to be considered. In this paper, the original VENTURE algorithm is compared against two state-of-the-art metaheuristics for combinatorial network optimization. The two metaheuristics are first presented and then adapted for the VENTURE problem. Finally, the performance of the VENTURE algorithm and the two proposed metaheuristics is numerically evaluated using an exact solving method as reference.