{'fraction_non_alphanumeric': 0.022082018927444796, 'fraction_numerical': 0.0, 'mean_word_length': 5.56551724137931, '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}}
On multiplexing gain for networks with deterministic delay guarantees

Multiplexing gain has been studied extensively in the context of statistical characterizations of traffic streams with quality-of-service criteria such as packet loss probability, mean delay, and delay variance. In this paper, we demonstrate that multiplexing gain can also arise in the context of deterministic traffic constraint functions, service curve scheduling, and quality-of-service requirements based on deterministic delay constraints. We show how to evaluate this multiplexing gain via the use of deterministic network calculus for both worst-case and time-averaged delay constraints. We show that significant multiplexing gain can be achieved in a deterministic setting using numerical examples drawn from a number of well-known MPEG video traces. Our results have application to provisioning services with tight, real-time constraints on end-to-end delay performance.