{'fraction_non_alphanumeric': 0.01527331189710611, 'fraction_numerical': 0.0, 'mean_word_length': 5.163366336633663, '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}}
Inter-Machine Exchange of Real Time in Distributed Computer Systems

The possibilities of increasing the likelihood of timely service and reducing the average waiting time for requests for inter-machine exchange in distributed real-time computer systems are investigated. The analyzed effect is achieved as a result of redundant multi-way transmissions of packets that are critical to delays, which provide for the replication of transmitted packets with the task for each replica of the path (route) of the sequential passage of network nodes. The condition for the timeliness of the reserved transmissions is that the accumulated waiting in the queues of the nodes making up the path, at least for one of the replicas, does not exceed the maximum permissible time. An analytical model is proposed for estimating the average delays of multi-path redundant transmissions, when determined by the average delivery time of the first of the replicas transmitted in different ways. For requests critical to service delays, the influence of the frequency of reservation (replication) of requests on the probability of their timely service and the average waiting time accumulated at the nodes of the path for the replica delivered first was analyzed.