{'fraction_non_alphanumeric': 0.021231422505307854, 'fraction_numerical': 0.0, 'mean_word_length': 5.051282051282051, '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}}
A Markov model for per-user service of opportunistic scheduling

In this paper, we consider maximum rate opportunistic scheduling from a single wireless base station with a single antenna to multiple mobile users, each equipped with a single antenna. We show that a finite-state Markovian model can capture the dynamics of a single user's service, namely peruser service. We consider a saturated scenario, where the base station always has buffered data for transmission.