{'fraction_non_alphanumeric': 0.017741935483870968, 'fraction_numerical': 0.0032258064516129032, 'mean_word_length': 5.21, '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}}
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing

This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic relay node selection algorithm for overlay routing is proposed. The algorithm can find effective relay nodes for end-to-end links in an overlay network, and is scalable and robust due to its decentralization and randomization. Based on the simulation results, the algorithm is able to maintain a good performance when 40% end nodes in an overlay network encounter failures.