{'fraction_non_alphanumeric': 0.026856240126382307, 'fraction_numerical': 0.00315955766192733, 'mean_word_length': 4.763636363636364, '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}}
"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks

We extend and relax the concept of tree-farm previously implicitly introduced for the design of the multicast protocol SplitStream. Our extension enables the tree-farm concept to be applied to non vertex-symmetric overlay networks. In particular, we demonstrate that, in the case of the de Bruijn overlay network used in P2P systems such as Koorde and D2B, our relaxed notion of tree-farm achieves higher multicast throughput than when using a single BFS tree rooted at every source, or when the sources share a common set of trees like in PrefixStream.