A fair scheduling algorithm with traffic classification for wireless networks

Authors:
You-Chiun Wang;Shiang-Rung Ye;Yu-Chee Tseng
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsin-Chu, 30050 Taiwan, ROC;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsin-Chu, 30050 Taiwan, ROC;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsin-Chu, 30050 Taiwan, ROC
Venue:
Computer Communications
Year:
2005

Citing 8
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Adapting packet fair queueing algorithms to wireless networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A wireless fair service algorithm for packet cellular networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
W2F2Q: packet fair queuing in wireless packet networks

WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Online hybrid traffic classifier for Peer-to-Peer systems based on network processors

Applied Soft Computing

Quantified Score

Hi-index	0.24

Visualization

Abstract

Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays may be incurred for real-time flows. To resolve this problem, we propose a traffic-dependent wireless fair queuing (TD-FQ) algorithm that takes traffic types of flows into consideration when scheduling packets. The proposed TD-FQ algorithm not only alleviates queuing delay of real-time flows, but also guarantees bounded delays and fairness for all flows.