{'fraction_non_alphanumeric': 0.015784586815227482, 'fraction_numerical': 0.0, 'mean_word_length': 5.090395480225989, '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}}
A clustered tree method for implementing application level multicast

In this paper, we present a clustered tree-based protocol for constructing efficient overlay structure for application-level multicast. Unlike existing approaches, the constructed clustered multicast trees do not depend solely on the underlying network communications but also on the bandwidth required by the application. In the constructed tree, end hosts are clustered into appropriate groups based on a predefined threshold for unicast latency. In any given cluster, every host-except for one that is responsible for connecting to other cluster- has a parent in that cluster. The buffer at each host is used to control how many clients a host can handle; this determines the bandwidth at the host. Clusters are connected to each other based on minimum unicast latency rule. The result shows that the protocol constructs an optimized topology to reflect the bandwidth required for a given data dissemination rate. It also minimizes the maximum delay to deliver data packets from source to all recipients.