Achieving packet-level quality of service through scheduling in multirate WLANs
Title | Achieving packet-level quality of service through scheduling in multirate WLANs |
Publication Type | Conference Papers |
Year of Publication | 2004 |
Authors | Yuan Y, Gu D, Arbaugh WA, Zhang J |
Conference Name | Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th |
Date Published | 2004/09/26/29 |
Publisher | IEEE |
ISBN Number | 0-7803-8521-7 |
Keywords | Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS |
Abstract | Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159% of state-of-the-art scheduling algorithms in simulated scenarios. |
DOI | 10.1109/VETECF.2004.1400554 |