{'fraction_non_alphanumeric': 0.01995305164319249, 'fraction_numerical': 0.0, 'mean_word_length': 5.181159420289855, '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}}
Linear time, possibly disjoint path search approach for ethernet based industrial automation networks

One of the most important requirements for the industrial networks, apart from the real-time capability, is the reliability. There are several methods that can be used to increase the communication reliability. One of them is data duplication, which is afterwards transmitted using two different (disjoint) paths. Since, such path search for time triggered Ethernet based systems is typically done during engineering, it is important to keep the time needed for that as short as possible. Especially, if some topology changes are foreseen causing system re-engineering. Therefore in this paper an algorithm is proposed that has linear time complexity and is able to find two possibly disjoint paths for an arbitrary network topology in a short time.