{'fraction_non_alphanumeric': 0.014326647564469915, 'fraction_numerical': 0.0028653295128939827, 'mean_word_length': 4.776859504132231, '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}}
On the law of iterated logarithm for extreme queue length in an open queueing network

The purpose of this research in the field of the open queueing network is to prove the Law of the Iterated Logarithm (LIL) for the extreme value of the queue length of customers in an open queueing network. LIL is proved for the extreme values of the queue length of customers the important probability characteristic of the queueing system under conditions of heavy traffic. Also, we present for extreme queue length of jobs Probability Laws ((theorems on the LIL, Fluid Limits Theorem and Diffusion Limit Theorem) in various conditions of traffic and simulating an open queueing network in Appendices 1 and 2.