{'fraction_non_alphanumeric': 0.020477815699658702, 'fraction_numerical': 0.0, 'mean_word_length': 4.87, '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 algorithm for multicasting in a large network

In this paper we introduce a new multicast routing algorithm to be used in a large network. The proposed algorithm is a hybrid of the core based tree (CBT) and protocol independent multicast-sparse mode (PIM-SM) and builds a bidirectional shared tree centered around a rendezvous point and shortest path trees rooted at some senders. Multicast messages are distributed along the bidirectional shared tree and the shortest path trees and, therefore, the message delivery delay is lower than both the CBT and the PIM-SM.