{'fraction_non_alphanumeric': 0.013568521031207599, 'fraction_numerical': 0.0, 'mean_word_length': 5.709090909090909, '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}}
Throughput maximization for ARQ-like systems in fading channels with coding and queuing delay constraints

Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.