{'fraction_non_alphanumeric': 0.01752577319587629, 'fraction_numerical': 0.0, 'mean_word_length': 5.06875, '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}}
An efficient routing to minimize the cost for dynamic multicasting

Multicast has become increasingly important as networks are used to carry continuous media traffic such as voice and video to the end user. In dynamic multicasting, destination nodes are joining and leaving the group during the communication period. A re-routing may produce an optimal route, but it is impractical for various reasons. A better routing could be possible, without re-routing, if the users behavior can be predicted. With the increasing popularity of advance resource reservation, it is possible to estimate the users' duration of staying time, and thus a better routing that can efficiently minimize the total cost of whole session is feasible. We propose a centralized heuristic routing algorithm, which optimizes the total cost of the Steiner tree over the whole session period. The efficiency of our proposed algorithm over Greedy and Naive algorithms is shown by simulation results.