{'fraction_non_alphanumeric': 0.020282186948853614, 'fraction_numerical': 0.0, 'mean_word_length': 5.637426900584796, '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}}
Vertex-centric distributed computation for mapping virtual networks across domains

Orchestration across network domains is essential for providing end-to-end network services in software-defined infrastructures. In this paper, we propose a vertex-centric distributed computing algorithm for finding all feasible mappings of a mesh virtual network request across domains. Our proposed algorithm is based on a distributed orchestration framework, where the topology information is locally maintained within each domain without disclosing to any centralized broker. The proposed algorithm first partitions a mesh virtual network request into a set of linear sub-requests and applies a vertex-centric distributed computing algorithm to find all feasible mappings of each individual linear sub-request. The feasible mappings of sub- requests are then merged to obtain all feasible mappings of the original virtual network request. Our simulation results show that partitioning a virtual network request to longer, balanced-length, non-overlap-link linear sub-requests is more scalable by significantly lowering the total computation time.