{'fraction_non_alphanumeric': 0.01902587519025875, 'fraction_numerical': 0.0045662100456621, 'mean_word_length': 5.322115384615385, '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}}
Traffic models and admission control for variable-bit-rate continuous media transmission with deterministic service

In recent years many research efforts have focussed on resource reservation and call admission for the case when hard guarantees are required, and on the development of algorithms that take time-invariant descriptions of continuous media (CM) flows with stringent delay requirements. In this paper we take a different approach and address the problem of call admission by developing an algorithm that uses more general descriptions of stored CM flows which are not necessarily time-invariant. We present an algorithm for producing a parsimonious flow description which improves the network resource utilization as much as 200-250 percent over the best possible utilization that can be achieved using any time-invariant workload function. We also present the admissibility conditions for flows with more general descriptions that need not be time-invariant, where packets are scheduled according to the earliest- deadline-first scheduling policy. This generalizes an earlier result. Furthermore, we present an algorithm for testing for admissibility of a new flow whose computational complexity is linear in the number of flows, i.e., the same as the case when time-invariant descriptions are used.