{'fraction_non_alphanumeric': 0.02570694087403599, 'fraction_numerical': 0.0, 'mean_word_length': 5.598870056497175, '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}}
Applying Generalized Cμ-rule Scheduling for Resource Allocation in OFDMA Systems

We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity.