{'fraction_non_alphanumeric': 0.025669642857142856, 'fraction_numerical': 0.004464285714285714, 'mean_word_length': 4.75, '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}}
The general N server finite queue

Kingman (1962) studied the effect of queue discipline on the mean and variance of the waiting time. He made no assumptions regarding the stochastic nature of the input and the service distributions, except that the input and service processes are independent of each other. When the following two conditions hold: (a) no server sits idle while there are customers waiting to be served; (b) the busy period is finite with probability one (i.e., the queue empties infinitely often with probability one); he has shown that the mean waiting time is independent of the queue discipline and the variance of the waiting time is a minimum when the customers are served in order of their arrival. Conditions (a) and (b) will henceforward be called Kingman conditions and a queueing system satisfying Kingman conditions will be referred to in the text as a Kingman queue.