{'fraction_non_alphanumeric': 0.013777267508610792, 'fraction_numerical': 0.0, 'mean_word_length': 5.0979020979020975, '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}}
Method for estimating delays in parallel redundant data transfer networks

This paper presents a unified method for estimating latencies in a parallel redundant network with losses. The proposed method is based on mathematical statistics and, in the opinion of the authors, is more instructive in small networks than typical estimations that are based on the Markov chain model, which is recommended by ITU. The method requires known CDFs of latencies of parallel networks, as well as their packet loss rates. The CDFs can be built from experimental data or can be approximated in accordance to assumed distribution function. The method eliminates the need to calculate the transition probabilities that are required in the Markov chain. Also, the method can be used for various number of parallel networks. However, the method is applicable only for independent networks