{'fraction_non_alphanumeric': 0.008958566629339306, 'fraction_numerical': 0.0, 'mean_word_length': 5.622222222222222, '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 and wavelength assignment in sparse splitting all optical networks

With the rapid development of high performance networking technology, multicast routing with light path has become a very important and challenging issue in the fields of wavelength routed optical networks. In this paper, we study Steiner tree heuristics in all optical multicast routing in sparse light splitting wavelength division multiplexing (WDM) networks. We present an efficient heuristic algorithm based on greedy approach to construct multicast tree for a given multicast request. The performance of our algorithm is analyzed through simulation in a wide range of network topologies and random session. The result shows that our mechanism requires least number of wavelengths per fiber and total wavelength channels for a given session with respect to existing multicast tree generation algorithms