Multiclass priority fair queuing for hybrid wired/wireless quality of service support

Abstract

The widescale deployment of packetized wireless network services currently lacks 4 mechanism to provide QoS in the jmmework of existing backbone networks. This paper describes 4 wireless scheduling algorithm that can provide QoS bounds to ATM tmfic. It tmnsjorms the standard ATM trafFc classes into pammeters for 4 priority, fair queuing algorithm, implemented at the wireless MAC layer. By supporting existing ATM tmfic, 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. The scheduler maps ATM QoS pammeters into priorities and weights for the wireless MAC. The protocol supports CBR, rtVBR, nrt-VBR, ABR, and VBR trafic. Real-time data uses 4 wireless fair queuing model. Non-real-time data is processed by 4 weighted round robin scheduler and 4 recirculating service queue that guamntees minimum cell rate (MCR). Best-eflort trajfic is serviced using a simple FIFO mechanism. Buffers are shared across priorities to make more e&ient use of memory.