{'fraction_non_alphanumeric': 0.02767175572519084, 'fraction_numerical': 0.0014312977099236641, 'mean_word_length': 4.841225626740947, '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}}
Adaptive Real-time Many-to-many Group Multicast

This paper shows how to provide an adaptive real-time group multicast (many-to-many) communication service. Such a service can be used by applications, like au-dio/video tele-conferencing, that require low loss, and bounded delay and jitter. In order to meet deterministic quality of service (QoS) requirements of a real-time group multicast, some communication resources are reserved. In this work we show (i) how bandwidth is reserved for each group, and (ii) how an active user that transmit to the multicast group can dynamically share, with other active users, the bandwidth allocated to their group. Quality of service support for a real-time multicast group is based on time driven priority 3]. In this scheme the time is divided into time frames of xed duration and all the time frames are aligned by using a global time reference which can be obtained from GPS (global positioning system). Bandwidth is allocated to a multicast group as a whole, rather than individually to each user. The allocation is done by reserving time intervals within time frames in some periodic fashion. This sort of allocation raises two problems that are studied in this paper: (1) Scheduling: how time intervals are reserved to each multicast group, and (2) Adaptive sharing: how the participants dynamically share the time intervals that have been reserved for their multicast group. The proposed approach is based on embedding multiple virtual rings, one for each multicast group. By using the virtual rings it is simple to route messages to all the participants, while minimizing the bound on the buuer sizes and queuing delays. The last part of the paper introduces a scalable growth of the multicast group by adding multiple subtrees to the virtual ring. Adding listeners (receiving only) nodes on subtrees is simple. However, adding active nodes that transmit from the subtree to the multicast group is more complex and may not be adaptive This complexity helps understanding some of the virtues of using virtual rings for adaptive real-time multicast.