{'fraction_non_alphanumeric': 0.023088023088023088, 'fraction_numerical': 0.0, 'mean_word_length': 5.5424528301886795, '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}}
Efficient dynamic multicast traffic grooming algorithm on WDM networks

This paper investigates the dynamic multicast traffic grooming problem for optical mesh networks, which are configured with partial wavelength converters and partial light splitters. In the dynamic provisioning context, a typical multicast connection may require bandwidth less than that of a wavelength channel. Unlike the case of unicast, a multicast session has multiple destinations. We note a fact that the session has less blocking probability if it has fewer destinations. Then we develop a grooming scheme for multicast traffic on mesh WDM networks with sparse wavelength converters and light splitters configuration, named Multicast Tree Decompose (MTD) algorithm. The main idea of MTD is to try to decrease the destination number using the working multicast tree. Firstly, a simple layered auxiliary graph (layered-AG) is proposed to address the generalized wavelength continuity (GWC) constraint. What is more, a novel multicast tree algorithm is proposed to build more efficient multicast routing under the constraints of sparse multicast capable OXCs. Then we can decrease the destination number using "to partial destinations from source tree" (TPDST) and "to partial destination tree" (TPDT). From the simulation results, MTD algorithm has better performance compared with existing grooming schemes.