 based on fair scheduling, and how to adapt this type of scheduling to wireless networks. A landmark paper by Lu et al. in this domain describes the adaptation of the wireline fluid fair queuing algorithm to handle location-dependent error bursts. 23 This work is also cited in another significant paper by Ramanathan and Agrawal, 24 where the difficulty of adapting fair queuing algorithms to wire- less networks is considered. Their proposal aims to provide a long-term fairness guarantee while making efficient use of the air interface. This is achieved mainly by providing supple- mental bandwidth to sessions that, due to poor quality of the wireless channel, have not received satisfactory service in the short term. The fairness is ensured by keeping track of the supplemental bandwidth granted in a "fairness server." This research is cited and built upon 246 Open Radio Access Network (O-RAN) Systems Architecture and Design in numerous papers, including work by Nandagopal et al., which evaluates the performance seven wireless fair queuing algorithms. 25 The same authors later write an excellent sum- mary of the issues and approaches to fair queuing in wireless networks26 and present a further improved algorithm taking Automatic Repeat Request (ARQ) into account for error- prone wireless channels in Ref. 27 Ng et al. discuss other algorithms aiming to counter location-dependent errors in wireless networks in Ref. 28 Work in this field actively continues: Namgi Kim and Hyunsoo Yoon have recently presented another fair queuing algorithm with link level retransmission (ARQ) in Ref. 29 Unfortunately, fair queuing is expensive to implement in processor resources. This issue has been tackled by Shreedhar and Varghese, who achieve almost perfect fairness using a modified RR algorithm. 30 Other variations on the topic of fair scheduling include adapting fair scheduling to multicarrier systems such as OFDM, 31 and to systems with multiple trans- mit and receive antennas (MIMO). 32 QoS priority-based scheduling has received com