{'fraction_non_alphanumeric': 0.020023557126030624, 'fraction_numerical': 0.002355712603062426, 'mean_word_length': 5.343283582089552, '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}}
Burst handling of digital video traffic

Digital video traffic is inherently bursty for two reasons: the inherent motion of the objects and cameras, and artifacts of the compression algorithms. Because digital video playback requires bandwidth guarantees from the underlying I/O and network systems, the bursty nature of video traffic forces bandwidth reservations to be made at the level of the peak data rates rather than at the average data rates. This paper addresses the burstiness problem in digital video traffic by proposing changes to the MPEG compression/decompression algorithm. The resulting algorithm, called block-by-block (BBB) difference coding, successfully minimizes the difference between peak and average bit rates by a factor of 2 to 3 on average, without compromising the compression efficiency, coding speed and video quality.