{'fraction_non_alphanumeric': 0.014861995753715499, 'fraction_numerical': 0.0, 'mean_word_length': 5.371621621621622, '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}}
Dynamic multicast on loss networks

Dynamic multicast allows members to join or leave the multicast session during its active period. In this paper, we propose a dynamic multicast routing scheme which integrates the consideration of maximum-free-circuit routing on loss networks and changes of membership. Two reference reward estimation schemes, the uniform reference reward scheme and weighted reference reward scheme for the maximum-free-circuit routing are proposed. Routing algorithms consisting of the initial connection setup as well as the joining and leaving of members are also developed. Using simulation experiments, the benefits of the weighted reference reward involve more revenue generated and a higher probability for successfully connecting a member when it issues a join request. On the other hand, the routing algorithm based on the uniform reference reward scheme can connect more members in the initial connection setup.