{'fraction_non_alphanumeric': 0.035555555555555556, 'fraction_numerical': 0.0014814814814814814, 'mean_word_length': 4.728813559322034, '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}}
Complexity Analysis of Routing Algorithms in Computer Networks

There is a huge growth of the Internet users in the last years. The network became overloaded. One of the necessary processes in computer networks is routing, performed by various algorithms. It became important to analyze the complexity of routing strategies. This paper includes a complexity analysis of two routing strategies. We have showed, that the space complexity of routing with routing tables in network with n nodes is O(nlog∆) and the time is O(1). The space complexity of interval routing with at most k intervals is O(k∆logn) and the time is O(log(k∆)), where ∆ is the maximum degree of the graph.