{'fraction_non_alphanumeric': 0.03236514522821577, 'fraction_numerical': 0.0, 'mean_word_length': 5.414893617021277, '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}}
Virtual network embedding: An optimal decomposition approach

In network virtualization, a traditional ISP collapses into two independent tiers, where the infrastructure provider (InP) manages the physical (or substrate) networks and the service provider (SP) operates the service (or virtual) networks. In this work, we investigate the virtual network embedding (VNE) problem, which bridges above two tiers by mapping the virtual network request to the substrate networks. Existing VNE approaches are either optimal Integer Linear Programming formulations that suffer from extensive computational time, or relaxation/heuristics (mostly decompose the VNE problem into link mapping (LM) and node assignment (NA) sub-problems) that are unable to provide an optimal solution or near-optimal solution with guaranteed quality. In this paper, we attempt to fill this gap with a new VNE solution, which relies on an iterative process enabling feedbacks between the NA, and LM sub-problems (obtained based on the Primal-dual analysis of the VNE problem). With our approach, one can reach either an optimal solution or a near optimal solution with a per-instance guarantee on its closeness to the optimal solution.