Multiclass priority fair queuing for hybrid wired/wireless quality of service support
Jay R. Moorman, John W. Lockwood · 1999
The widescale deployment of packetized wireless network services currently lacks a mechanism to provide QoS in the framework of existing backbone networks. This paper describes a wireless scheduling algorithm that can provide QoS bounds to ATM traffic. It transforms the standard ATM traffic classes into parameters for a priority, fair queuing algorithm, implemented at the wireless MAC layer. By supporting existing ATM traffic, the scheduler avoids the need to redefine QoS specifically for the packetized wireless channel. Bounds are derived for delay and throughput on the individual CBR and rt-VBR virtual connections.