W2F2Q: packet fair queuing in wireless packet networks

Abstract

Recently, there is a growing interest in wireless packet communications due to the explosive growth in wireless communications and the Internet. In this stage, quality of service (QoS) provisioning in wireless/mobile packet networks is becoming more and more important. A key factor in QoS provisioning is packet-scheduling. However, conventional scheduling algorithms in wired network cannot be directly applicable to wireless communication environments because of wireless-specific characteristics : bursty and location-dependent errors. In this paper, we propose a new wireless packet scheduling method: Wireless Worst-case Fair Weighted Fair Queuing ( W 2 F 2 Q ). The proposed W 2 F 2 Q is based on W F 2 Q + [1, 2], which is the most accurate packet scheduling algorithm among those emulating the ideal GPS algorithm. W 2 F 2 Q uses the tight globally bounded timestamp (GBT) property [9] of W F 2 Q + to detect leading and lagging status of each flow. Theoretical analysis verifies that W 2 F 2 Q guarantees the fairness property among flows. Also, simulation experiments show the effect of readjusting and graceful degradation in W 2 F 2 Q .