{'fraction_non_alphanumeric': 0.017605633802816902, 'fraction_numerical': 0.0, 'mean_word_length': 5.518348623853211, '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}}
Multiuser Effective Capacity analysis for Queue Length Based Rate Maximum wireless scheduling

Recently the Effective Capacity of multi-user wireless scheduling has been analyzed based on large deviation principle. The users' queue length distribution bound of wireless scheduling algorithm such as round robin and rate maximum was discussed based on Effective Capacity analysis. But for Queue Length Based (QLB) Rate Maximum scheduling algorithm, the analysis result is only limited to system bound performance and not for each user's bound performance. In this paper we consider each user's amount of input traffic and channel statistical characteristics and introduce a new Effective Capacity analysis model for QLB scheduling algorithm. The queue length distribution bound of the QLB scheduling algorithm for each user is then predicted by the proposed analysis model. Based on the predicted queue length distribution bound, we can set different queue length threshold, that is, delay constraint (queue length can be translated to delay) for each user to obtain different queue length violation (or delay constraint violation or queue overflow) probability. Then the effect of each user's amount of input traffic to their queue length (or delay constraint) violation probability in multiuser environment is analyzed. The proposed analysis model and the estimation results have been verified by numerical simulations.