{'fraction_non_alphanumeric': 0.017105263157894738, 'fraction_numerical': 0.0, 'mean_word_length': 5.8558558558558556, '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}}
Deflection routing in complex networks

Contention is the main source of information loss in buffer-less network architectures where deflection routing is a viable contention resolution scheme. In recent years, various reinforcement learning-based deflection routing algorithms have been proposed. However, performance of these algorithms has not been evaluated in larger networks that resemble the autonomous system-level topology of the Internet. In this paper, we compare performance of three reinforcement learning-based deflection routing algorithms by using topologies generated with Waxman and Barabási-Albert algorithms. We examine the scalability of deflection routing algorithms by increasing the network size while keeping the network load constant.