{'fraction_non_alphanumeric': 0.025295109612141653, 'fraction_numerical': 0.0, 'mean_word_length': 5.0561224489795915, '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 Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols

Application layer multicast (ALM) enables rapid deployment of multicast applications in the Internet. In ALM, application hosts organise themselves into an overlay topology on top of the underlying unicast network. Application data is multicast over the overlay network. In general, ALM protocols can be classified as either tree-first or mesh-first approach. In this paper, we provide a survey and simulation study for the class of tree-first ALM protocols. We investigate the efficiency of HMTP, TBCP, NICE and several variants of transformation-based protocols in terms of tree cost and delay optimisation. To the best of our knowledge, this paper provides the first head-to-head comparison of various tree-first protocols in a single simulation environment. Results show that depth-first searching technique in HMTP can achieve the lowest cost trees. On the other hand, a transformation-based technique that involves only local region nodes is able to construct low latency trees. In addition, we propose an enhancement to TBCP to improve its performance in producing low delay trees.