QoS provisioning for wireless IP networks with multiple classes through flexible fair queuing
Toni Janevski, B. Spasenovski · 2002
We propose a scheduling algorithm, a wireless class-based flexible fair queuing (WCFQ), to support QoS demands of different traffic classes and at time varying error rates in wireless IP networks. It uses priorities to distinguish between best-effort class and class with guaranteed bandwidth, which is further divided into CBR, VBR and guaranteed best-effort subclasses. WFQ is applied within each class/subclass in an error-free state. During error-state, CBR flows receive their guaranteed service rate until a predefined limit is reached by weight adjustment. The algorithm swaps portion of bandwidth between erroneous and error-free best-effort flows that leads to their maximized throughput over long time scales.