{'fraction_non_alphanumeric': 0.024120603015075376, 'fraction_numerical': 0.0, 'mean_word_length': 5.30379746835443, '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}}
Hierarchical scheduling for multiple classes of applications in connection-oriented integrated-service networks

Multiple classes of conventional and multimedia applications are expected to be supported by the emerging connection-oriented integrated-service networks, where best-effort flows and quality of service (QoS) flows co-exist. We propose a novel two-level hierarchical scheduling algorithm, which provides an integrated, simple scheme to distribute the link bandwidth among a dynamic set of flows in the network, such that: every QoS flow always receives a bandwidth which guarantees the required quality of service; and after the requirements of the QoS flows are satisfied, the rest of the network bandwidth is fairly shared among all best-effort and soft-QoS flows. We extend our hierarchical scheduling algorithm to support both bursty and non-bursty flows. We also discuss the techniques which make the throughput of a QoS flow to be constantly lower bounded and/or upper bounded.