{'fraction_non_alphanumeric': 0.02142857142857143, 'fraction_numerical': 0.0, 'mean_word_length': 5.138686131386861, '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}}
Queue-aware scheduling and congestion control for LTE

In this paper, we study the performance of LTE, for various types of queue-aware scheduling, while an end-to-end congestion control algorithm controls the rate of elastic traffic. First we introduce our definition of queue-aware scheduling at a base station, and explain how it allocates resources to competing flows where channel conditions are time-varying. Then we apply different types of congestion price for the end-to-end congestion control algorithm and study the performance of the network when such scheduling algorithms and congestion controls jointly exist. In this paper, we show that different combinations of queue-aware scheduling at the base station and congestion control implemented at end users can lead to major differences in the obtained throughput and fairness.