{'fraction_non_alphanumeric': 0.008849557522123894, 'fraction_numerical': 0.0, 'mean_word_length': 5.505747126436781, '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}}
Algorithms for selection and allocation of virtual network requests

In recent years Network Virtualization has gained considerable attention from the scientific community once it provides mechanisms to overcome the ossification problem of the current Internet architecture. One of the main problems regarding Network Virtualization is the Network Embedding Problem, since it is a NP-Hard problem. In this work we present a new embedding algorithm based on the Tabu Search Metaheuristic and propose a VN selection policy based on the Bidimensional Knapsack Problem.