{'fraction_non_alphanumeric': 0.0166358595194085, 'fraction_numerical': 0.0, 'mean_word_length': 5.296511627906977, '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}}
Fair scheduling algorithm for wireless packet networks

In wireless packet networks, fair scheduling algorithms originally devised for wireline networks should be adapted to deal with bursty and location-dependent wireless channel errors. We present WGPS (Wireless General Processor Sharing) as a wireless fair scheduling and PWGPS (Packetized Wireless General Processor Sharing) as a packet scheduling algorithm realizing WGPS. WGPS is an extension of GPS (Generalized Processor Sharing), the fair scheduling in wired networks, and operates differently from GPS only when there is any flow suffering channel errors. While a flow is in burst error state, the flow is excluded from scheduling and the other flows that have a good channel for transmission are scheduled according to their service shares. In return for the lost service, the flow having suffered burst error state is compensated by increasing its service share by a prescribed amount when its channel has recovered. PWGPS approximates WGPS by serving packets in the order of service finish times as determined by WGPS.