{'fraction_non_alphanumeric': 0.024043715846994537, 'fraction_numerical': 0.002185792349726776, 'mean_word_length': 4.585365853658536, '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}}
Sojourn times in (discrete) time shared systems and their continuous time limits

We study the mean sojourn times in two M/G/1 weighted round-robin systems: the weight of a customer at any given point in time in the first system is a function of its age (imparted service), while in the second system the weight is a function of the customer’s remaining processing time (RPT). We provide a sufficient condition under which the sojourn time of a customer with large service requirement (say, x) and that arrives in the steady state is close to that of a customer which starts a busy period and has the same service requirement. A sufficient condition is then provided for continuity of the performance metric (the mean sojourn time) as the quanta size in the discrete time system converges to 0. We then consider a multi-class system and provide relative ordering of the mean sojourn times among the various classes.