{'fraction_non_alphanumeric': 0.02727272727272727, 'fraction_numerical': 0.0, 'mean_word_length': 4.924731182795699, '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}}
Congestion-free routing reconfiguration: Formulation and examples

We consider the network-layer problem of avoiding congestion while reconfiguring the routing paths. We formulate a flow-based and a switch-based model. For the flow-based model, we demonstrate that an optimal sequence of minimum update steps could always be found when the dependency graph is acyclic. For the switch-based model, we find a way to translate a feasible flow-based sequence to a feasible switch-based sequence subject to a tree topology constraint on the routing paths.