{'fraction_non_alphanumeric': 0.034834324553950725, 'fraction_numerical': 0.0016992353440951572, 'mean_word_length': 4.94949494949495, '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}}
Characterize the minimum required resources for admission control of pre-recorded VBR video transmission by an O(n log n) algorithm

Given a pre-recorded VBR video, we have proposed an O(n) algorithm to smooth the transmission schedule with the minimum required resources. N is the number of video frames. As n is usually very large and varying for different videos, it is not suitable for online computation. To facilitate resource management and admission control for QoS (quality-of-service) guarantees, we need to explore the relations among the required resources. Thus, whenever a new request is presented, the admission control procedure can easily check the required resources against the available resources and decides to admit this new request or not. To compute these relations (such as rate-buffer and rate-delay), a native algorithm takes O(n/sup 3/) time complexity. An O(n log n) algorithm is proposed to characterize the low-bounds of resources allocated for transmitting a pre-recorded VBR video. Having these pre-computed functions, the admission control procedure is as simple as a chart look-up with O(1) time complexity to allocate the required resources.