{'fraction_non_alphanumeric': 0.023608768971332208, 'fraction_numerical': 0.0, 'mean_word_length': 5.827586206896552, '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}}
Distributed QoS constrained multicast algorithms

Broadband group communication over the Internet is becoming ubiquitous over a wide range of services. These applications are usually delay-sensitive and demanding on network resources. The multicast QoS-routing problem is usually described as the construction of constrained Steiner minimal tree (SMT). In this paper, we examine the proposed SMT heuristics in the literature confining our attention to constrained, distributed, asymmetric heuristics. We present a constrained-SMT algorithm, which is highly feasible for distributed processing.