{'fraction_non_alphanumeric': 0.018912529550827423, 'fraction_numerical': 0.0, 'mean_word_length': 5.093525179856115, '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}}
Multicast routing in WDM networks without splitters

Multicasting in WDM core networks is an efficient way to economize network resources for several multimedia applications. Due to their complexity and cost, multicast capable switches are rare in the proposed architectures. The paper investigates the multicast routing without splitters in directed (asymmetric) graphs. The objective is to minimize the number of used wavelengths and if there are several solutions, choose the lowest cost one. We show that the optimal solution is a set of light-trails. An efficient heuristic is proposed to minimize conflicts between the light-trails, and so to minimize the number of used wavelengths. The performance is compared to existing light-trail based heuristics. Our algorithm provides a good solution with a few wavelengths required and a low cost.