{'fraction_non_alphanumeric': 0.02577319587628866, 'fraction_numerical': 0.002061855670103093, 'mean_word_length': 5.473333333333334, '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}}
Embedding virtual multicast trees in software-defined networks

Network virtualization enables the decoupling of network services from the underlying hardware infrastructure to allow the same Substrate/physical Network (SN) shared by multiple Virtual Network (VN) requests. The process of mapping virtual nodes and links onto a shared SN while satisfying the computing and bandwidth constraints is referred to Virtual Network Embedding (VNE) as an NP-hard problem. In this paper, for the first time, we explore how to efficiently map a given Virtual Multicast Tree (VMT) request onto a substrate network. We propose a novel algorithm, namely, Virtual Multicast Tree Embedding based on dynamic Impact Factor (VMTE-IF) to minimize the required resource and redundant multicast transmission in the substrate network. The experimental results show that our algorithm outperforms the traditional greedy-based algorithms over 50% in terms of the cost of bandwidth consumption.