{'fraction_non_alphanumeric': 0.020163831127914304, 'fraction_numerical': 0.0, 'mean_word_length': 5.786324786324786, '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}}
Route adaptation and persistence in networks

This dissertation studies the trade-off between route adaptation and persistence. Our thesis is that adding route persistence to shortest-path routing can enhance network performance, especially under heavy traffic conditions. Shortest-path routing can cause route oscillation and instability, thereby increasing congestion and reducing the effective throughput of the network. 
To study the effect of route persistence on network performance, the dissertation introduces a new class of routing techniques, called semi-persistent techniques, that offer a trade-off between route adaptation and persistence. Semi-persistent techniques add route persistence to shortest-path routing by decoupling route installation from the shortest-path computation. This route persistence reduces oscillation by reducing the number of routes that shift from high-traffic links to low-traffic links. With various levels of route persistence, semi-persistent techniques exhibit multiple routing behaviors that span a spectrum between shortest-path and static routing. 
This dissertation offers a promising advance for network routing. Simulation results show that certain semi-persistent techniques achieve significant throughput increases over shortest-path routing for a majority of the studied topologies and traffic loads. With further study of the relationship between traffic load and the persistence level of maximal throughput, semi-persistent techniques may be designed to effectively adjust their routing behavior to suit current network conditions.