{'fraction_non_alphanumeric': 0.01905829596412556, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
Adaptive routing based on predictive reinforcement learning

Abstract In this paper, optimized reinforcement learning-based adaptive network routing is investigated. Shortest path routing is most suitable network routing algorithm for wired network but not suitable for any wireless network. In high traffic conditions, shortest path will always select the shortest path (in terms of number of hops) between source and destination thus generating more congestion. The proposed method optimized reinforcement-based routing algorithm is based on predictive mechanism, where the path is selected on demand. It means, path is selected based on the actual traffic present on the network. Thus, they guarantee the least delivery time to reach the packets to the destination. Simulation and Analysis are done on periodic and non-periodic traffic and delivery time is used as an estimation parameter.