{'fraction_non_alphanumeric': 0.028216704288939052, 'fraction_numerical': 0.001128668171557562, 'mean_word_length': 4.993243243243243, '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}}
Performance analysis of multi-server based on processor-sharing queue

In the last few decades, the performance analysis of multi-server has become a research hotspot. We consider a distributed server system in which heterogeneous servers operating under the processor sharing(PS) discipline. In this system, when a stream of users' requests arrive at a dispatcher, it will dispatch each user to different servers respectively. In this paper, we analyze the performance of a single server using the finite capacity M/M/1/N-PS model. For this model, two exact expressions are derived for both user's average service time and average waiting time. Then we analyze the performance of the system by adopting different assignment strategies. Finally, considering the limitation of the service time and the waiting time, we give an assignment strategy in order to obtain the best performance.