{'fraction_non_alphanumeric': 0.010845986984815618, 'fraction_numerical': 0.0, 'mean_word_length': 4.916666666666667, '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 Optimization In Overlay Multicast Based on Location and Bandwidth

One of the main parts of peer-to-peer multicast is the structure of overlay network. Most of the existing works utilize some common parameters for constructing overlay tree. These parameters are bandwidth and delay. The mismatch between current overlay structure and underlying network topology causes severe link stress and then leads to high end to end latency. According to these problems, we propose a new overlay construction algorithm called OLT in this paper that finds the location of peers and tries to connect peers that are as close as possible. OLT exploits a number of heuristic techniques to reach an optimized tree even in case of peer heterogeneity and high churn rate. Our simulations show that OLT reduces link stress and latency because it constructs a logical tree more compatible to physical network than the existing algorithms.