{'fraction_non_alphanumeric': 0.027266530334014997, 'fraction_numerical': 0.0, 'mean_word_length': 5.168067226890757, '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}}
Using feedback control for a network and CPU resource management application

Interactive multimedia and sensor-based real-time applications on the Internet must be delivered to the receiver at the sender's transmission rate and have bounded end-to-end delay requirements. We call such flows real-rate flows. The resource requirements of such flows can not be met in many environments. Researchers have proposed selectively dropping data in the flow so that the data rate matches available resource capacity (i.e., QoS adaptive, real-rate flows). Application-level QoS adaptation is not well integrated with network scheduling mechanisms and resource management, resulting in slow and inaccurate QoS adaptation, poor flow quality, and unpredictable interactions between adaptive mechanisms. Our proposed resource management service integrates QoS adaptation and network/CPU scheduling mechanisms to offer support for QoS adaptive, real-rate flows. Its goal is to deliver the highest quality flow to the receiver within a bounded delay at the sender's real rate. This service combines two techniques - both based on feedback real-rate scheduling and QoS adaptation. Real-rate scheduling uses packet time-stamps to schedule flows along the flow path at the sender's real rate. QoS adaptation drops data at a node when the node's resources are limited, in application-specified priority order. System modeling issues are discussed and a controller structure is proposed.