{'fraction_non_alphanumeric': 0.009283819628647215, 'fraction_numerical': 0.0, 'mean_word_length': 4.992063492063492, '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}}
Local optimization of routing tables for data networks

Data communication networks generally contain routing tables at each of the nodes of the network. We consider the routing tables at a given node to specify the fraction of traffic for each destination that should travel over each of the outgoing links from the given node. An iteration algorithm is presented which, when applied at each node using update information from adjoining nodes, converges to the routing tables that minimize average delay in the network for stationary input statistics. The algorithm has the property that the traffic to each destination is guaranteed to be loop free at each iteration of the algorithm. Several kinds of loop freedom and their implications are discussed.