{'fraction_non_alphanumeric': 0.013333333333333334, 'fraction_numerical': 0.0, 'mean_word_length': 5.2592592592592595, '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}}
Sub-optimal routing in unreliable packet switched computer communication network

The paper is devoted to introduce and describe an approach leading to sub-optimal traffic routing in unreliable packet-switched computer network. It is assumed that average packet delay in unreliable network may be estimated based on average packet delays obtained both for the reliable and the unreliable networks; it is approximated by linear function of both considered delays. It is also assumed that optimal routing in network, when failure of particular channel occurs may be replaced by re-routing performed only in some separate part of the network containing the channel with failure.