{'fraction_non_alphanumeric': 0.015549076773566569, 'fraction_numerical': 0.0, 'mean_word_length': 4.885714285714286, '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}}
Design and Analysis of Improved Shortest Path Tree Update for Network Routing

The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whenever the network topology changes, the old SPT must be updated. In a network with a large number of nodes, the technology with the whole SPT re-computation by traditional static algorithms is very inefficient. It will take tremendous computation time and make routing table instability by unnecessary changes in an existing SPT. In this paper, we propose an improved algorithm for the dynamic SPT update to solve the above problems. The proposed algorithm is based on the understanding of the dynamic update process to reduce redundancy. Only significant edges that contribute to the construction of the new SPT will be considered. The analysis of the algorithm complexity and experimental results shows that our algorithm is much better than any others in the literature.