{'fraction_non_alphanumeric': 0.019197207678883072, 'fraction_numerical': 0.002617801047120419, 'mean_word_length': 5.036842105263158, '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}}
Analyzing multi-class, multi-server queueing systems with preemtive priorities

In this paper we consider a multi-class, multi-server queueing system with preemptive priorities. We distinguish two groups of priority classes that consist of multiple items, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times. We derive an approximate method to estimate the steady state probabilities with an approximation error that can be made as small as desired at the expense of some more numerical matrix iterations. Based on these probabilities, we can derive approximations for a wide range of relevant performance characteristics, such as the expected postponement time for each item class and the first and second moment of the number of items of a certain type in the system. We illustrate our method with some numerical examples. Comparison to simulation results shows that with a moderate number of matrix iterations (~20) we can estimate key performance measures, such as the mean and variance of the number of items in the system, with an error less than 1% in most cases.