Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks

Sheng-Tzong CHENG
Ming-Hung TAO

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B    No.4    pp.1568-1576
Publication Date: 2005/04/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.4.1568
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
Keyword: 
fair scheduling,  weighted-sacrificing fair queueing,  packetized weighted sacrificing fair queueing,  

Full Text: PDF(496.4KB)>>
Buy this Article


Summary: 
Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limited-buffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematical analysis and simulations.