{'fraction_non_alphanumeric': 0.019441069258809233, 'fraction_numerical': 0.0, 'mean_word_length': 5.387596899224806, '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}}
Multi-path OSPF performance of a software router in a link failure scenario

In this paper we analyze intra-domain routing protocols improvements to support new features required by real time services. In particular we introduce OSPF Fast Convergence and highlights the advantage of using an incremental algorithm instead of Djikstra one to compute the shortest paths. Then we propose a new multi-path incremental algorithm that we have implemented in OSPF code of Quagga open-source routing software. Analyzing an index characterizing OSPF performance we compare our algorithm with an incremental algorithm not supporting multi-path and demonstrate that, even if multi-path support, the reconfiguration times are really similar; moreover,in some cases, our algorithm performs better, especially in a link failure scenario.