{'fraction_non_alphanumeric': 0.014267185473411154, 'fraction_numerical': 0.0, 'mean_word_length': 5.078740157480315, '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}}
Transient queue length distribution of the shortest queue model

In this paper, we consider a service systems consisting of two parallel servers. Each server has a queue with infinite capacity. The arrival process of customers is a renewal process and the service times of customers are independent and exponentially distributed with different parameter in different queue. A new arrival join the shortest of two queues, where in case of both queues have equal length, the arrival join any of the two queues according to some arbitrary probability distribution. Jockeying between the queues is not allowed. By Markov skeleton processes theory, we obtain the transient queue length distribution, and show that it is the minimal nonnegative solution of a backward equation.