{'fraction_non_alphanumeric': 0.01675977653631285, 'fraction_numerical': 0.0, 'mean_word_length': 6.029411764705882, '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}}
Proportional fairness scheduling on tandem network

We study packet scheduling algorithms that satisfy multiple performance objectives simultaneously. We have realized the proportional fairness principle based QoS model, which defines both delay and loss rate requirements of a class, to include fairness. The resulting proportional fairness scheduling algorithms on a tandem network formalize the goals of the network performance, user's QoS requirements and system fairness, and expose the fundamental tradeoffs between these goals. In particular, it is difficult to provide these objects simultaneously. By performing simulation and measurement experiments, we evaluate the proportional fairness of the algorithm.